A branch and bound algorithm for the maximum diversity problem
- 1 January 2010
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 200 (1), 36-44
- https://doi.org/10.1016/j.ejor.2008.12.023
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Hybrid heuristics for the maximum diversity problemComputational Optimization and Applications, 2007
- Iterated tabu search for the maximum diversity problemApplied Mathematics and Computation, 2007
- Tabu search and GRASP for the maximum diversity problemEuropean Journal of Operational Research, 2007
- Heuristic algorithms for the maximum diversity problemJournal of Information and Optimization Sciences, 1998
- Computational aspects of the maximum diversity problemOperations Research Letters, 1996
- Analyzing and Modeling the Maximum Diversity Problem by Zero‐One Programming*Decision Sciences, 1993
- Improved Linear Integer Programming Formulations of Nonlinear Integer ProblemsManagement Science, 1975
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear ProgramOperations Research, 1974