Heuristic algorithms for the maximum diversity problem
From MaRDI portal
Publication:4398552
DOI10.1080/02522667.1998.10699366zbMath0903.90121OpenAlexW2026342695MaRDI QIDQ4398552
Ching-Chung Kuo, Fred Glover, Krishna S. Dhir
Publication date: 20 July 1998
Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02522667.1998.10699366
Related Items
A branch and bound algorithm for the maximum diversity problem, Iterated tabu search for the maximum diversity problem, Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems, GRASP and path relinking for the equitable dispersion problem, Tabu search and GRASP for the maximum diversity problem, A hybrid three-phase approach for the Max-Mean dispersion problem, A tabu search based memetic algorithm for the Max-Mean dispersion problem, Hybrid heuristics for the maximum diversity problem, An exact semidefinite programming approach for the max-mean dispersion 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, A review on discrete diversity and dispersion maximization from an OR perspective, A two-phase tabu search based evolutionary algorithm for the maximum diversity problem, Initialization of metaheuristics: comprehensive review, critical analysis, and research directions, Heuristics for the capacitated dispersion problem, Formulations and valid inequalities for the capacitated dispersion problem, A simple and effective algorithm for the MaxMin diversity problem, Memetic self-adaptive evolution strategies applied to the maximum diversity problem, Enriching Solutions to Combinatorial Problems via Solution Engineering, \(t\)-linearization for the maximum diversity problem, Heuristic solution approaches for the maximum minsum dispersion problem, Effective metaheuristic algorithms for the minimum differential dispersion problem, Solving the maximum min-sum dispersion by alternating formulations of two different problems, Maximum diversity/similarity models with extension to part grouping, A Davidson college multi-objective assignment problem: a case study, Hybrid scatter tabu search for unconstrained global optimization, Iterated greedy for the maximum diversity problem, Measuring diversity. A review and an empirical analysis, Construction and improvement algorithms for dispersion problems, A heuristic approach for the max-min diversity problem based on max-clique, The equitable dispersion problem, Heuristics for the bi-objective path dissimilarity problem, On the linear ordering problem and the rankability of data, GRASP and path relinking for the max-min diversity problem, A hybrid metaheuristic method for the maximum diversity problem
Cites Work
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
- Computational aspects of the maximum diversity problem
- A discrete optimization model for preserving biological diversity
- Dynamic tabu list management using the reverse elimination method
- Large-scale controlled rounding using tabu search with strategic oscillation
- Tabu search for a class of scheduling problems
- On Diversity
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
