Abstract
For the p-center problem, we propose a new smart local search based on the critical vertex concept and embed it in a GRASP framework. Experimental results attest the robustness of the proposed search procedure and confirm that for benchmark instances it converges to optimal or near/optimal solutions faster than the best known state-of-the-art local search.
Cite
CITATION STYLE
Ferone, D., Festa, P., Napoletano, A., & Resende, M. G. C. (2017). A new local search for the p-center problem based on the critical vertex concept. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10556 LNCS, pp. 79–92). Springer Verlag. https://doi.org/10.1007/978-3-319-69404-7_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
