Computational aspects of the maximum diversity problem
- 31 October 1996
- journal article
- Published by Elsevier BV in Operations Research Letters
- Vol. 19 (4), 175-181
- https://doi.org/10.1016/0167-6377(96)00025-9
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Greedy Randomized Adaptive Search ProceduresJournal of Global Optimization, 1995
- Analyzing and Modeling the Maximum Diversity Problem by Zero‐One Programming*Decision Sciences, 1993
- A GRASP™ for a difficult single machine scheduling problemComputers & Operations Research, 1991
- Lexicographic bottleneck problemsOperations Research Letters, 1991
- Computational aspects of a branch and bound algorithm for quadratic zero-one programmingComputing, 1990
- Semi-greedy heuristics: An empirical studyOperations Research Letters, 1987