Computational aspects of the maximum diversity problem
Ghosh, J. B.
Operations Research Letters
175 - 181
MetadataShow full item record
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/10887
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.