Heuristic algorithms for the maximum diversity problem
From MaRDI portal
Publication:4398552
DOI10.1080/02522667.1998.10699366zbMATH Open0903.90121OpenAlexW2026342695MaRDI QIDQ4398552FDOQ4398552
Recommendations
Cites work
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- A discrete optimization model for preserving biological diversity
- Computational aspects of the maximum diversity problem
- Dynamic tabu list management using the reverse elimination method
- Large-scale controlled rounding using tabu search with strategic oscillation
- On Diversity
- Optimization by simulated annealing
- Tabu search for a class of scheduling problems
- Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
Cited in
(39)- A review on discrete diversity and dispersion maximization from an OR perspective
- A hybrid metaheuristic method for the maximum diversity problem
- A simple and effective algorithm for the MaxMin diversity problem
- A Davidson college multi-objective assignment problem: a case study
- A hybrid three-phase approach for the Max-Mean dispersion problem
- A tabu search based memetic algorithm for the Max-Mean dispersion problem
- On the linear ordering problem and the rankability of data
- Heuristic solution approaches for the maximum minsum dispersion problem
- Including a diversity criterion in decision making
- An empirical comparison of heuristic methods for creating maximally diverse groups
- A branch and bound algorithm for the maximum diversity problem
- A two-phase intensification tabu search algorithm for the maximum min-sum dispersion problem
- Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS
- Iterated greedy for the maximum diversity problem
- Measuring diversity. A review and an empirical analysis
- \(t\)-linearization for the maximum diversity problem
- The equitable dispersion problem
- A heuristic approach for the max-min diversity problem based on max-clique
- Hybrid scatter tabu search for unconstrained global optimization
- Enriching Solutions to Combinatorial Problems via Solution Engineering
- A two-phase tabu search based evolutionary algorithm for the maximum diversity problem
- Heuristics for the capacitated dispersion problem
- Heuristics for the bi-objective path dissimilarity problem
- Initialization of metaheuristics: comprehensive review, critical analysis, and research directions
- Tabu search and GRASP for the maximum diversity problem
- Iterated tabu search for the maximum diversity problem
- GRASP and path relinking for the max-min diversity problem
- Formulations and valid inequalities for the capacitated dispersion problem
- Maximizing single attribute diversity in group selection
- Maximum diversity/similarity models with extension to part grouping
- Construction and improvement algorithms for dispersion problems
- An exact semidefinite programming approach for the max-mean dispersion problem
- GRASP and path relinking for the equitable dispersion problem
- Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems
- Using decomposition to improve greedy solutions of the optimal diversity management problem
- Effective metaheuristic algorithms for the minimum differential dispersion problem
- Solving the maximum min-sum dispersion by alternating formulations of two different problems
- Hybrid heuristics for the maximum diversity problem
- Memetic self-adaptive evolution strategies applied to the maximum diversity problem
This page was built for publication: Heuristic algorithms for the maximum diversity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4398552)
