@techreport{TD:7BSN88,
	att_abstract={{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 - based on the GRASP and path relinking methodologies - for finding approximate solutions to this optimization problem.  We explore different ways to hybridize GRASP and path relinking, including the recently proposed variant known as GRASP with evolutionary path relinking.  Empirical results indicate that the proposed hybrid implementations compare favorably to previous metaheuristics, such as tabu search and simulated annealing. }},
	att_authors={mr5626},
	att_categories={},
	att_copyright={{}},
	att_copyright_notice={{}},
	att_donotupload={},
	att_private={false},
	att_projects={},
	att_tags={Max-Min Diversity Problem, Adaptive Memory Programming, Heuristics, GRASP, Metaheuristics, Path Relinking},
	att_techdoc={true},
	att_techdoc_key={TD:7BSN88},
	att_url={http://web1.research.att.com:81/techdocs_downloads/TD:7BSN88_DS1_2010-08-18T15:19:54.683Z.pdf},
	author={Mauricio Resende and Rafael Martí and Micael Gallego and Abraham Duarte},
	institution={{}},
	month={February},
	title={{GRASP and path relinking for the max-min diversity problem}},
	year=2008,
}