Measuring diversity. A review and an empirical analysis
From MaRDI portal
Publication:2029033
DOI10.1016/j.ejor.2020.07.053zbMath1487.90564OpenAlexW3046875909MaRDI QIDQ2029033
Francisco Parreño, Rafael Martí, Ramón Alvarez-Valdés
Publication date: 3 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.07.053
Social networks; opinion dynamics (91D30) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items
A review on discrete diversity and dispersion maximization from an OR perspective, An exact cutting plane method for the Euclidean max-sum diversity problem, Formulations and valid inequalities for the capacitated dispersion problem, Finding optimal solutions to several gray pattern instances
Uses Software
Cites Work
- An integer programming approach for solving the \(p\)-dispersion problem
- GRASP and path relinking for the equitable dispersion problem
- Heuristic solution approaches for the maximum minsum dispersion problem
- Good solutions to discrete noxious location problems via metaheuristics
- Tabu search and GRASP for the maximum diversity problem
- Tabu search versus GRASP for the maximum diversity problem
- The equitable dispersion problem
- GRASP and path relinking for the max-min diversity problem
- Analytical models for locating undesirable facilities
- Computational aspects of the maximum diversity problem
- Approximation algorithms for maximum dispersion
- Metaheuristics for business analytics. A decision modeling approach
- A discrete optimization model for preserving biological diversity
- A branch and bound algorithm for the maximum diversity problem
- Iterated tabu search for the maximum diversity problem
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- Upper bounds and exact algorithms for \(p\)-dispersion problems
- Hybrid heuristics for the maximum diversity problem
- Location on Tree Networks: P-Centre and n-Dispersion Problems
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Heuristic and Special Case Algorithms for Dispersion Problems
- Heuristic algorithms for the maximum diversity problem
- Lagrangian solution of maximum dispersion problems
