A New Formulation and Resolution Method for the p-Center Problem

References

• Balas E., Ho A. Set-covering algorithms using cutting planes, heuristics and subgradient optimization: A computational study. Math. Programming Stud. (1980) 12:37–60Crossref, Google Scholar
• Beasley J. E. OR-Library: distributing test problems by electronic mail. J. Oper. Res. Soc. (1990) 41:1069–1072Crossref, Google Scholar
• Daskin M.Network and Discrete Location (1995) (Wiley, New York) Crossref, Google Scholar
• Daskin M. A new approach to solving the vertex p-center problem to optimality: Algorithm and computational results. Comm. Oper. Res. Soc. Japan (2000) 45:428–436Google Scholar
• Elloumi S., Labbé M., Pochet Y. Generalisations of the p-center problem: Formulations and solution methods. XV Conf. Eur. Chap. Combin. Optim. (2002) Lugano, SwitzerlandMay 2002Google Scholar
• Hochbaum D., Shmoys D. A best possible heuristic for the k-center problem. Math. Oper. Res. (1985) 10:180–184Link, Google Scholar
• Hochbaum D., Shmoys D. A unified approach to approximation algorithms for bottleneck problems. J. Assoc. Comput. Machinery (1986) 33:533–550Crossref, Google Scholar
• Hsu W. L., Nemhauser G. L. Easy and hard bottleneck location problems. Discrete Appl. Math. (1979) I:209–216Crossref, Google Scholar
• Ilhan T., Pinar M. C. An efficient exact algorithm for the vertex p-center problem. (2001) . http://www.optimization-online.org/DB_HTML/2001/09/376.htmlGoogle Scholar
• Kariv O., Hakimi S. L. An algorithmic approach to network location problems. Part 1: The p-centers. SIAM J. Appl. Math. (1979) 37:513–538Crossref, Google Scholar
• Khuller S., Pless R., Sussmann Y. Fault tolerant k-center problems. Theoret. Comput. Sci. (2000) 242:237–245Crossref, Google Scholar
• Krumke S. O. On a generalization of the p-center problem. Inform. Processing Lett. (1995) 56:67–71Crossref, Google Scholar
• Marianov V., ReVelle C., Drezner Z. Siting emergency services. Facility Location: A Survey of Applications and Methods (1995) (Springer-Verlag, New York) 199–222Springer Series in Operations ResearchCrossref, Google Scholar
• Masuyama S., Ibaraki T., Hasegawa T. The computational complexity of the m-center problems on the plane. Trans. IECE Japan (1981) E-64:57–64Google Scholar
• Megiddo N., Tamir A., Zemel E., Chandrasekaran R. An O(nlog2n) algorithm for the kth longest path in a tree with applications to location problems. SIAM J. Comput. (1981) 10:328–337Crossref, Google Scholar
• Mladenovic N., Labbé M., Hansen P. Tabu search and variable neighborhood search in solving the p-center problem. ULB-ISRO preprint 2000/20 (2000) . http://smg.ulb.ac.be/Google Scholar
• Reinelt G. TSPLIB-a traveling salesman problem library. ORSA J. Comput. (1991) 3:376–384Link, Google Scholar
• ReVelle C., Toregas C., Swain R., Bergman L. The location of emergency service facilities. Oper. Res. (1971) 19:1363–1373Link, Google Scholar