A review on discrete diversity and dispersion maximization from an OR perspective
From MaRDI portal
Publication:2670513
Recommendations
- Measuring diversity. A review and an empirical analysis
- Construction and improvement algorithms for dispersion problems
- Heuristic algorithms for the maximum diversity problem
- A branch and bound algorithm for the maximum diversity problem
- An integer programming approach for solving the p-dispersion problem
Cites work
- A branch and bound algorithm for the maximum diversity problem
- A discrete optimization model for preserving biological diversity
- A hybrid metaheuristic method for the maximum diversity problem
- A hybrid three-phase approach for the Max-Mean dispersion problem
- A new compact formulation for the discrete p-dispersion problem
- A simple and effective algorithm for the MaxMin diversity problem
- A tabu search based memetic algorithm for the Max-Mean dispersion problem
- An Analysis of Network Location Problems with Distance Constraints
- An application of tabu search heuristic for the maximum edge-weighted subgraph problem
- An exact semidefinite programming approach for the max-mean dispersion problem
- An integer programming approach for solving the p-dispersion problem
- Analytical models for locating undesirable facilities
- Approximation algorithms for dispersion problems
- Computational aspects of the maximum diversity problem
- Construction and improvement algorithms for dispersion problems
- Facility dispersion problems under capacity and cost constraints
- Good solutions to discrete noxious location problems via metaheuristics
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- GRASP and path relinking for the equitable dispersion problem
- GRASP and path relinking for the max-min diversity problem
- Greedy randomized adaptive search procedures
- Heuristic algorithms for the maximum diversity problem
- Heuristic solution approaches for the maximum minsum dispersion problem
- Heuristics for the capacitated dispersion problem
- Hybrid heuristics for the maximum diversity problem
- Iterated greedy for the maximum diversity problem
- Iterated tabu search for the maximum diversity problem
- Lagrangian solution of maximum dispersion problems
- Location on Tree Networks: P-Centre and n-Dispersion Problems
- Maximum dispersion and geometric maximum weight cliques
- Measuring diversity. A review and an empirical analysis
- Memetic self-adaptive evolution strategies applied to the maximum diversity problem
- Optimization by simulated annealing
- Search Methodologies
- Semi-greedy heuristics: An empirical study
- Solving the capacitated clustering problem with variable neighborhood search
- Solving the maximum min-sum dispersion by alternating formulations of two different problems
- Tabu search and GRASP for the maximum diversity problem
- Tabu search tutorial. A graph drawing application
- Tabu search versus GRASP for the maximum diversity problem
- The discrete p-dispersion problem
- The equitable dispersion problem
- The unconstrained binary quadratic programming problem: a survey
- Upper bounds and exact algorithms for \(p\)-dispersion problems
- Variable neighborhood search for the heaviest \(k\)-subgraph
Cited in
(17)- Measuring diversity. A review and an empirical analysis
- An exact cutting plane method for the Euclidean max-sum diversity problem
- Discrete Diversity and Dispersion Maximization
- Formulations and valid inequalities for the capacitated dispersion problem
- On the price of diversity for multiwinner elections under (weakly) separable scoring rules
- Randomized transport plans via hierarchical fully probabilistic design
- On cutting plane algorithms for nonlinear binary optimization
- Solving Euclidean max-sum problems exactly with cutting planes
- A fast and effective breakpoints heuristic algorithm for the quadratic knapsack problem
- Mathematical optimization modelling for group counterfactual explanations
- Corrigendum to: ``A review on discrete diversity and dispersion maximization from an OR perspective
- Multiple linear ordering problem
- Fast exact algorithms for the maximum diversity problem
- The most dispersed subset of random points in \(\mathbb{R}^d\)
- An exact method for the bi-objective p-median max-sum diversity problem
- Maximal minimal spacing for random points
- On disperse generalized linear models
This page was built for publication: A review on discrete diversity and dispersion maximization from an OR perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2670513)
