GRASP and path relinking for the max-min diversity problem

The Max-Min Diversity Problem (MMDP) consists in selecting a subset of elements from a given set in such a way that the diversity among the selected elements is maximized. The problem is NP-hard and can be formulated as an integer linear program. Since the 1980s, several solution methods for this problem have been developed and applied to a variety of fields, particularly in the social and biological sciences. We propose a heuristic method

• Type: Journal
• Year: 2010
• Where: COR
• Authors: Mauricio G. C. Resende, Rafael Martí, Micael Gallego, Abraham Duarte
• Keywords: COR 2010, Integer Linear Program, Max-Min Diversity Problem, Solution Methods