A hybrid three-phase approach for the Max-Mean dispersion problem
DOI10.1016/J.COR.2016.01.003zbMATH Open1349.90788OpenAlexW2239027276MaRDI QIDQ342328FDOQ342328
Authors: Michele Garraffa, Fabio Salassa, F. 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
Recommendations
- A hybrid heuristic approach based on a quadratic knapsack formulation for the max-mean dispersion problem
- A hybrid heuristic for the maximum dispersion problem
- An exact semidefinite programming approach for the max-mean dispersion problem
- A tabu search based memetic algorithm for the Max-Mean dispersion problem
- A heuristic for solving the maximum dispersion problem
hybrid heuristicsfractional combinatorial optimizationmax-mean dispersion problemquadratic binary programming
Fractional programming (90C32) Combinatorial optimization (90C27) Clustering in the social and behavioral sciences (91C20) Integer programming (90C10)
Cites Work
- The quadratic knapsack problem -- a survey
- Local branching
- Fundamentals of scatter search and path relinking
- The equitable dispersion 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
- GRASP and path relinking for the equitable dispersion problem
- Heuristic algorithms for the maximum diversity problem
- 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
Cited In (11)
- An exact semidefinite programming approach for the max-mean dispersion problem
- VNS variants for the Max-Mean dispersion problem
- A two-phase intensification tabu search algorithm for the maximum min-sum dispersion problem
- A heuristic for solving the maximum dispersion problem
- Tabu search guided by reinforcement learning for the max-mean 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 tabu search based memetic algorithm for the Max-Mean dispersion problem
- A hybrid metaheuristic of integrating estimation of distribution algorithm with Tabu search for the max-mean dispersion problem
- A hybrid heuristic for the maximum dispersion problem
- A hybrid heuristic approach based on a quadratic knapsack formulation for the max-mean dispersion problem
Uses Software
This page was built for publication: A hybrid three-phase approach for the Max-Mean dispersion problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342328)
