Discrete Diversity and Dispersion Maximization
From MaRDI portal
Publication:6138963
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Collections of articles of miscellaneous specific interest (00B15) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Recommendations
- A hybrid metaheuristic method for the maximum diversity problem
- A review on discrete diversity and dispersion maximization from an OR perspective
- Hybrid heuristics for the maximum diversity problem
- Tabu search and GRASP for the maximum diversity problem
- Effective metaheuristic algorithms for the minimum differential dispersion problem
- Diversity Maximization Approach for Multiobjective Optimization
- Introducing dynamic diversity into a discrete particle swarm optimization
- A hybrid heuristic for the maximum dispersion problem
This page was built for publication: Discrete Diversity and Dispersion Maximization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6138963)