p-Center Problems - Location Science - page 89

Hsu W-L, Nemhauser GL (1979) Easy and hard bottleneck location problems. Discrete Appl Math
1:209-215
Ilhan T, Pınar MÇ (2001) An efficient exact algorithm for the vertex p-center problem. Technical
report, Department of Industrial Engineering, Bilkent University. http://www.ie.bilkent.edu.tr/~
mustafap/pubs
Jaeger M, Goldberg J (1994) A polynomial algorithm for the equal capacity p-center problem on
trees. Transp Sci 28:167-175
Kariv O, Hakimi SL (1979) An algorithmic approach to network location problems. I: the
p-centers. SIAM J Appl Math 37:513-538
Khuller S, Sussmann YJ (2000) The capacitated k-center problem. SIAM J Discrete Math
13:403-418
Khuller S, Pless R, Sussmann YJ (2000) Fault tolerant K-center problems. Theor Comput Sci
242:237-245
Krumke OS (1995) On a generalization of the p-center problem. Inform Process Lett 56:67-71
Lorena LAN, Senne ELF (2004) A column generation approach to capacitated p-median problems.
Comput Oper Res 31:863-876
Martinich JS (1988) A vertex-closing approach to the p-center problem. Nav Res Log 35:185-201
Megiddo N (1983) Linear-time algorithms for linear programming in R 3 and related problems.
SIAM J Comput 12:759-776
Mihelic J, Robic B (2005) Solving the k-center problem efficiently with a dominating set algo-
rithm. J Comput Inform Technol 13:225-233
Minieka E (1970) The m-center problem. SIAM Rev 12:138-139
Minieka E (1980) Conditional centers and medians on a graph. Networks 10:265-272
Mladenovic N, Labbé M, Hansen P (2003) Solving the p-center problem with tabu search and
variable neighborhood search. Networks 42:48-64
Ozsoy FA, Pinar MC (2006) An exact algorithm for the capacitated vertex p-center problem.
Comput Oper Res 33:1420-1436
Pullan W (2008) A memetic genetic algorithm for the vertex p-center problem. Evol Comput
16:417-436
Reinelt G (1991) TSPLIB - a traveling salesman problem library. ORSA J Comput 3:376-384
Salhi S, Al-Khedhairi A (2010) Integrating heuristic information into exact methods: the case of
the vertex p-centre problem. J Oper Res Soc 61:1619-1631
Scapparra MP, Pallotino S, Scutella MG (2004) Large-scale local search heuristics for the
capacitated vertex p-center problem. Networks 43:241-255
Tamir A (1987) On the solution value of the continuous p-center location problem on a graph.
Math Oper Res 12:340-349
Tamir A (1988) Improved complexity bounds for center location problems on networks fy using
dynamic data structures. SIAM J Discrete Math 1:377-396
Tansel BÇ (2011) Discrete center problems. In: Eiselt HA, Marianov V (eds) Foundations of
location analysis. Springer, New York, pp 79-106