Integrating heuristic information into exact methods: The case of the vertex p-centre problem
From MaRDI portal
Publication:4933644
DOI10.1057/jors.2009.91zbMath1196.90131OpenAlexW2022223798MaRDI QIDQ4933644
Said Salhi, Abdulrahman Al-khedhairi
Publication date: 14 October 2010
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.2009.91
locationexact methodmulti-level heuristicset covering problem (SCP)variable neighbourhood search (VNS)vertex \(p\)-centre
Related Items
The continuous \(p\)-centre problem: an investigation into variable neighbourhood search with memory, An adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problem, Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs, A vertex weighting-based double-tabu search algorithm for the classical \(p\)-center problem
Uses Software
