Measuring diversity. A review and an empirical analysis
type: Item
instance of: scholarly article
title: Measuring diversity. A review and an empirical analysis
zbMATH Open document ID: 1487.90564
author: Francisco Parreño
author: Rafael Martí
author: Ramón Alvarez-Valdes
published in: European Journal of Operational Research
publication date: 2021-06-03T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 91D30
zbMATH DE Number: 7354336
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: maximum diversity
zbMATH Keywords: mathematical formulations
zbMATH Keywords: empirical comparison
describes a project that uses: MDPLIB
MaRDI profile type: Publication
full work available at URL: j.ejor.2020.07.053
OpenAlex ID: W3046875909
cites work: Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
cites work: Lagrangian solution of maximum dispersion problems
cites work: Tabu search versus GRASP for the maximum diversity problem
cites work: Location on Tree Networks: P-Centre and n-Dispersion Problems
cites work: Metaheuristics for business analytics. A decision modeling approach
cites work: Tabu search and GRASP for the maximum diversity problem
cites work: Analytical models for locating undesirable facilities
cites work: Hybrid heuristics for the maximum diversity problem
cites work: Computational aspects of the maximum diversity problem
cites work: Heuristic algorithms for the maximum diversity problem
cites work: A discrete optimization model for preserving biological diversity
cites work: Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
cites work: Approximation algorithms for maximum dispersion
cites work: Good solutions to discrete noxious location problems via metaheuristics
cites work: A branch and bound algorithm for the maximum diversity problem
cites work: GRASP and path relinking for the equitable dispersion problem
cites work: Heuristic solution approaches for the maximum minsum dispersion problem
cites work: Iterated tabu search for the maximum diversity problem
cites work: Upper bounds and exact algorithms for \(p\)-dispersion problems
cites work: The equitable dispersion problem
cites work: Heuristic and Special Case Algorithms for Dispersion Problems
cites work: GRASP and path relinking for the max-min diversity problem
cites work: An integer programming approach for solving the \(p\)-dispersion problem
DOI: 10.1016/J.EJOR.2020.07.053
description: scientific article; zbMATH DE number 7354336