A review on discrete diversity and dispersion maximization from an OR perspective
Authors:
- Rafael MartíRMRafael Martí
- Anna Martínez-GavaraAMAnna Martínez-Gavara
- Sergio Pérez-PelóSPSergio Pérez-Peló
- Jesús Sánchez-OroJSJesús Sánchez-Oro
Open Access
- 1 June 2022
- journal article
- review article
- Published by Elsevier in European Journal of Operational Research
- Vol. 299 (3) , 795-813
Abstract
No abstract availableKeywords
Funding Information
- Ministerio de Economía y Competitividad
- Ministerio de Ciencia, Innovación y Universidades (PGC2018-0953322-B-C22)
- Ministerio de Ciencia, Innovación y Universidades (PGC2018-0953322-B-C21)
- Comunidad de Madrid
- European Commission (S2018/TCS-4566)
- European Commission (Y2018/EMT-5062)
This publication has 67 references indexed in Scilit:
- Comparing local search metaheuristics for the maximum diversity problemJournal of the Operational Research Society, 2011
- Hybrid heuristics for the maximum diversity problemComputational Optimization and Applications, 2007
- Tabu Search versus GRASP for the maximum diversity problem4OR, 2007
- Maximum Dispersion and Geometric Maximum Weight CliquesAlgorithmica, 2003
- Approximation Algorithms for Dispersion ProblemsJournal of Algorithms, 2001
- A discrete optimization model for preserving biological diversityApplied Mathematical Modelling, 1995
- Greedy Randomized Adaptive Search ProceduresJournal of Global Optimization, 1995
- Good solutions to discrete noxious location problems via metaheuristicsAnnals of Operations Research, 1992
- OR-Library: Distributing Test Problems by Electronic MailJournal of the Operational Research Society, 1990
- Optimization by Simulated AnnealingScience, 1983