The capacitated dispersion problem: an optimization model and a memetic algorithm
- 5 January 2021
- journal article
- research article
- Published by Springer Nature in Memetic Computing
- Vol. 13 (1) , 131-146
Abstract
No abstract availableKeywords
Funding Information
- Ministerio de Economía, Industria y Competitividad, Gobierno de España (PGC2018-0953322-B-C21)
This publication has 27 references indexed in Scilit:
- GRASP and path relinking for the max–min diversity problemComputers & Operations Research, 2010
- A branch and bound algorithm for the maximum diversity problemEuropean Journal of Operational Research, 2010
- Hybrid heuristics for the maximum diversity problemComputational Optimization and Applications, 2007
- Tabu search and GRASP for the maximum diversity problemEuropean Journal of Operational Research, 2007
- Principles of scatter searchEuropean Journal of Operational Research, 2006
- A template for scatter search and path relinking1998
- A discrete optimization model for preserving biological diversityApplied Mathematical Modelling, 1995
- Greedy Randomized Adaptive Search ProceduresJournal of Global Optimization, 1995
- Analyzing and Modeling the Maximum Diversity Problem by Zero‐One Programming*Decision Sciences, 1993
- HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTSDecision Sciences, 1977