Heuristic methods for the p-center problem
RAIRO-Oper. Res., 25 1 (1991) 65-72
Published online: 2017-02-07
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
A VNS method for the conditional p-next center problem
Jelena Tasić, Zorica Dražić and Zorica StanimirovićComputers & Operations Research 175 106916 (2025)
https://doi.org/10.1016/j.cor.2024.106916
A Modified Artificial Bee Colony Algorithm forp-Center Problems
Alkın Yurtkuran and Erdal EmelThe Scientific World Journal 2014 1 (2014)
https://doi.org/10.1155/2014/824196
Bee colony optimization for the p-center problem
Tatjana Davidović, Dušan Ramljak, Milica Šelmić and Dušan TeodorovićComputers & Operations Research 38 (10) 1367 (2011)
https://doi.org/10.1016/j.cor.2010.12.002
Dominant, an algorithm for the p-center problem
C. Caruso, A. Colorni and L. AloiEuropean Journal of Operational Research 149 (1) 53 (2003)
https://doi.org/10.1016/S0377-2217(02)00464-2
Facility Location
Frank PlastriaFacility Location 37 (2002)
https://doi.org/10.1007/978-3-642-56082-8_2
A new assignment rule to improve seed points algorithms for the continuous k-center problem
B. Pelegrín and L. CánovasEuropean Journal of Operational Research 104 (2) 366 (1998)
https://doi.org/10.1016/S0377-2217(97)00191-4
New heuristic algorithms for the rectangular $p$-cover problem
B. Pelegrín and L. CánovasRAIRO - Operations Research 29 (1) 73 (1995)
https://doi.org/10.1051/ro/1995290100731