Fast exact algorithms for the maximum diversity problem
- 20 November 2025
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 331 (2) , 396-405
Abstract
No abstract availableFunding Information
- Natural Science Foundation of Sichuan Province (2023NSFSC0059)
- Natural Science Foundation of Sichuan Province (2023NSFSC1415)
- National Natural Science Foundation of China (62372095)
- National Natural Science Foundation of China (62372093)
This publication has 15 references indexed in Scilit:
- An exact cutting plane method for the Euclidean max-sum diversity problemEuropean Journal of Operational Research, 2023
- A review on discrete diversity and dispersion maximization from an OR perspectiveEuropean Journal of Operational Research, 2022
- A two-phase tabu search based evolutionary algorithm for the maximum diversity problemDiscrete Optimization, 2022
- t-Linearization for the maximum diversity problemOptimization Letters, 2021
- Memetic self-adaptive evolution strategies applied to the maximum diversity problemOptimization Letters, 2013
- Heuristics and metaheuristics for the maximum diversity problemJournal of Heuristics, 2011
- A branch and bound algorithm for the maximum diversity problemEuropean Journal of Operational Research, 2010
- The equitable dispersion problemEuropean Journal of Operational Research, 2009
- Upper bounds and exact algorithms for -dispersion problemsComputers & Operations Research, 2006
- Computational aspects of the maximum diversity problemOperations Research Letters, 1996