A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem

DOI10.1007/978-3-319-09174-7_16zbMath1452.90260OpenAlexW117000231MaRDI QIDQ3195327

Fabio Salassa, Michele Garraffa, Frederico Della Croce

Publication date: 16 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-09174-7_16

zbMATH Keywords

quadratic programmingmatheuristicsmax-mean dispersion problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (4)

A hybrid three-phase approach for the Max-Mean dispersion problem ⋮ A tabu search based memetic algorithm for the Max-Mean dispersion problem ⋮ Tabu search guided by reinforcement learning for the max-mean dispersion problem ⋮ A hybrid metaheuristic of integrating estimation of distribution algorithm with Tabu search for the max-mean dispersion problem

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

This page was built for publication: A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem