Ghosh, J. B.2015-07-282015-07-2819960167-6377http://hdl.handle.net/11693/10887We 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.EnglishMaximum diversityComputational complexityHeuristicsArticle10.1016/0167-6377(96)00025-91872-7468