Article: An Integer Programming Approach to the Minimum Diversity Problem Journal: Journal of Business and Management (JBM) 1997 Vol.4 No.1 pp.93 - 111 Abstract: The minimum diversity problem is concerned with selecting a set of elements from some larger collection such that those chosen exhibit the smallest variety of characteristics. In this paper, we propose a framework within which the concept of diversity can be defined and the diversity of a set of elements can be measured. We then formulate a number of integer programs to model the minimum diversity problem and its variation. We also show the theoretical complexity of the problem and provide specialized methods for efficiently obtaining approximate solutions, which are submitted to empirical analysis. Inderscience Publishers - linking academia, business and industry through research

Title: An Integer Programming Approach to the Minimum Diversity Problem

Authors: Fred Glover; Ching-Chung Kuo; Krishna S. Dhir

Addresses: Author address listing can be found in the "About the Authors" section at the end of the article.

Abstract: The minimum diversity problem is concerned with selecting a set of elements from some larger collection such that those chosen exhibit the smallest variety of characteristics. In this paper, we propose a framework within which the concept of diversity can be defined and the diversity of a set of elements can be measured. We then formulate a number of integer programs to model the minimum diversity problem and its variation. We also show the theoretical complexity of the problem and provide specialized methods for efficiently obtaining approximate solutions, which are submitted to empirical analysis.

Keywords: Minimum diversity problem; integer programming; diversity; empirical analysis.

DOI: 10.1504/JBM.1997.141033

Journal of Business and Management, 1997 Vol.4 No.1, pp.93 - 111

Published online: 05 Sep 2024 *

Title: An Integer Programming Approach to the Minimum Diversity Problem

Keep up-to-date