Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach

DOI10.1016/J.COR.2013.09.017zbMath1348.90605OpenAlexW1999665594MaRDI QIDQ337222

Sylvain Perron, Pierre Hansen, Behnaz Saboonchi

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.09.017

zbMATH Keywords

combinatorial optimizationmetaheuristicsvariable neighborhood searchdispersion problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (4)

A tabu search based memetic algorithm for the Max-Mean 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 ⋮ The conditional \(p\)-dispersion problem

Cites Work

• A simple and effective algorithm for the MaxMin diversity problem
• The discrete p-dispersion problem
• Variable neighbourhood search: methods and applications
• A heuristic approach for the max-min diversity problem based on max-clique
• Variable neighborhood search for the heaviest \(k\)-subgraph
• GRASP and path relinking for the max-min diversity problem
• A comparison of \(p\)-dispersion heuristics
• Variable neighborhood search
• Comparison Of Four Models For dispersing Facilities
• Heuristic and Special Case Algorithms for Dispersion Problems
• Handbook of metaheuristics

This page was built for publication: Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach