Computational aspects of the maximum diversity problem

0.00 Avg rating—0 Votes

Article ID:	iaor1998334
Country:	Netherlands
Volume:	19
Issue:	4
Start Page Number:	175
End Page Number:	181
Publication Date:	Jan 1996
Journal:	Operations Research Letters
Authors:	Ghosh Jay B.
Keywords:	heuristics

Abstract:

We address two variations of the maximum diversity problem which arises when m elements are to be selected from an n-element population based on inter-element distances. We study problem complexity and propose randomized greedy heuristics. Performance of the heuristics is tested on a limited basis.

Reviews

Required fields are marked *. Your email address will not be published.