A heuristic approach for the max-min diversity problem based on max-clique
From MaRDI portal
Publication:1010298
DOI10.1016/j.cor.2008.09.007zbMath1179.90331OpenAlexW2027034184MaRDI QIDQ1010298
Andrea Grosso, Marco Locatelli, Frederico Della Croce
Publication date: 3 April 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2008.09.007
Related Items (17)
Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem ⋮ A review on algorithms for maximum clique problems ⋮ An integer programming approach for solving the \(p\)-dispersion problem ⋮ Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach ⋮ A hybrid three-phase approach for the Max-Mean dispersion problem ⋮ A tabu search based memetic algorithm for the Max-Mean dispersion problem ⋮ A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem ⋮ Tabu search guided by reinforcement learning for the max-mean dispersion 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 ⋮ A simple and effective algorithm for the MaxMin diversity problem ⋮ Dispersion with connectivity in wireless mesh networks ⋮ Effective metaheuristic algorithms for the minimum differential dispersion problem ⋮ A new compact formulation for the discrete \(p\)-dispersion problem ⋮ Construction and improvement algorithms for dispersion problems ⋮ A hybrid metaheuristic of integrating estimation of distribution algorithm with Tabu search for the max-mean dispersion problem ⋮ Depth-first simplicial partition for copositivity detection, with an application to MaxClique
Cites Work
- Unnamed Item
- Unnamed Item
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- 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
- 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
- Measure and conquer
- Location on Tree Networks: P-Centre and n-Dispersion Problems
- Heuristic algorithms for the maximum diversity problem
- Fixed-Parameter Tractability and Completeness I: Basic Results
- Lagrangian solution of maximum dispersion problems
This page was built for publication: A heuristic approach for the max-min diversity problem based on max-clique
