COMPUTATIONAL ASPECTS OF THE MAXIMUM DIVERSITY PROBLEM

Authors
GHOSH JB
Citation
Jb. Ghosh, COMPUTATIONAL ASPECTS OF THE MAXIMUM DIVERSITY PROBLEM, Operations research letters, 19(4), 1996, pp. 175-181
Citations number
10
Categorie Soggetti
Operatione Research & Management Science","Operatione Research & Management Science
Journal title
Operations research letters → ACNP
ISSN journal
01676377
Volume
19
Issue
4
Year of publication
1996
Pages
175 - 181
Database
ISI
SICI code
0167-6377(1996)19:4<175:CAOTMD>2.0.ZU;2-7
Abstract
We address two variations of the maximum diversity problem which arise s when m elements are to be selected from an n-element population base d on inter-element distances. We study problem complexity and propose randomized greedy heuristics. Performance of the heuristics is tested on a limited basis.