A hybrid three-phase approach for the Max-Mean dispersion problem
From MaRDI portal
Publication:342328
DOI10.1016/j.cor.2016.01.003zbMath1349.90788OpenAlexW2239027276MaRDI QIDQ342328
Fabio Salassa, Michele Garraffa, Frederico Della Croce
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2016.01.003
hybrid heuristicsfractional combinatorial optimizationmax-mean dispersion problemquadratic binary programming
Clustering in the social and behavioral sciences (91C20) Integer programming (90C10) Fractional programming (90C32) Combinatorial optimization (90C27)
Related Items (7)
A tabu search based memetic algorithm 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 review on discrete diversity and dispersion maximization from an OR perspective ⋮ Reinforcement learning enhanced multi-neighborhood tabu search for the max-mean dispersion problem ⋮ A hybrid metaheuristic of integrating estimation of distribution algorithm with Tabu search for the max-mean dispersion problem
Uses Software
Cites Work
- GRASP and path relinking for the equitable dispersion problem
- The quadratic knapsack problem -- a survey
- A heuristic approach for the max-min diversity problem based on max-clique
- The equitable dispersion problem
- GRASP and path relinking for the max-min diversity problem
- Computational aspects of the maximum diversity problem
- Local branching
- Solving \(k\)-cluster problems to optimality with semidefinite programming
- A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem
- Heuristic algorithms for the maximum diversity problem
- Unnamed Item
This page was built for publication: A hybrid three-phase approach for the Max-Mean dispersion problem