A simple and effective algorithm for the MaxMin diversity problem
From MaRDI portal
Publication:646655
DOI10.1007/s10479-011-0898-zzbMath1225.90154MaRDI QIDQ646655
Daniel Cosmin Porumbel, Fred Glover, Jin-Kao Hao
Publication date: 17 November 2011
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-011-0898-z
Related Items
Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach, A tabu search based memetic algorithm for the Max-Mean dispersion problem, Construction and improvement algorithms for dispersion problems, Effective metaheuristic algorithms for the minimum differential dispersion problem, A new compact formulation for the discrete \(p\)-dispersion problem, Solving the maximum min-sum dispersion by alternating formulations of two different problems, A hybrid metaheuristic of integrating estimation of distribution algorithm with Tabu search for the max-mean dispersion problem, Tabu search guided by reinforcement learning for the max-mean dispersion problem, A two-phase intensification tabu search algorithm for the maximum min-sum dispersion problem, A review on discrete diversity and dispersion maximization from an OR perspective
Uses Software
Cites Work
- Unnamed Item
- Good solutions to discrete noxious location problems via metaheuristics
- Tabu search and GRASP for the maximum diversity problem
- The discrete p-dispersion problem
- Tabu search versus GRASP for the maximum diversity problem
- Simple ingredients leading to very efficient heuristics for the maximum clique problem
- A heuristic approach for the max-min diversity problem based on max-clique
- GRASP and path relinking for the max-min diversity problem
- Computational aspects of the maximum diversity problem
- A fast algorithm for the maximum clique problem
- Iterated tabu search for the maximum diversity problem
- Hybrid heuristics for the maximum diversity problem
- Applications of the DM‐GRASP heuristic: a survey
- Heuristic algorithms for the maximum diversity problem
- Experimental and Efficient Algorithms