Computational aspects of the maximum diversity problem

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.

Saved in:
Bibliographic Details
Published in:Operations research letters 1996, Vol.19 (4), p.175-181
Main Author: Ghosh, Jay B.
Format: Article
Language:English
Subjects:
Applied sciences
Computational complexity
Exact sciences and technology
Heuristics
Mathematical programming
Maximum diversity
Operational research and scientific management
Operational research. Management science
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0167-6377
1872-7468
DOI:10.1016/0167-6377(96)00025-9