Geoscience Reference
In-Depth Information
Acknowledgements
The research of the second author is supported by the Interuniversity
Attraction Poles Programme initiated by the Belgian Science Policy Office and the research of
the third author is supported by the Turkish Academy of Sciences.
References
Albareda-Sambola M, Díaz JA, Fernández E (2010) Lagrangean duals and exact solution to the
capacitated p-center problem. Eur J Oper Res 201:71-81
Averbakh I (1997) On the complexity of a class of robust location problems. Working paper.
Western Washington University, Bellingham
Averbakh I, Berman O (1997) Minimax regret p-center location on a network with demand
uncertainty. Locat Sci 5:247-254
Averbakh I, Berman O (2000) Algorithms for the robust 1-center problem on a tree. Eur J Oper
Res 123:292-302
Bar-Ilan J, Kortsarz G, Peleg D (1993) How to allocate network centers. J Algorithm 15:385-415
Beasley JE (1990) OR-Library: distributing test problems by electronic mail. J Oper Res Soc
41:1069-1072
Berge B (1967) Théorie des graphes et ses applications. Dunod, Paris
Berman O, Drezner Z (2008) A new formulation for the conditional p-median and p-center
problems. Oper Res Lett 36:481-483
Berman O, Simchi-Levi D (1990) Conditional location problems on networks. Transp Sci 24:77-78
Bozkaya B, Tansel B (1998) A spanning tree approach to the absolute p-center problem. Locat Sci
6:83-107
Calik H (2013) Exact solution methodologies for the p-center problem under single and multiple
allocation strategies. Ph.D. thesis, Bilkent University, Ankara
Calik H, Tansel BC (2013) Double bound method for solving the p-center location problem.
Comput Oper Res 40:2991-2999
Chechik S, Peleg D (2012) The fault tolerant capacitated k-center problem. In: Structural
information and communication complexity. Springer, Berlin/Heidelberg
Chen D, Chen R (2013) Optimal algorithms for the Ǜ-neighbor p-center problem. Eur J Oper Res
225:36-43
Daskin MS (2013) Network and discrete location: models, algorithms, and applications, 2nd edn.
Wiley, Hoboken
Drezner Z (1989) Conditional p-center problems. Transp Sci 23:51-53
Dyer ME, Frieze AM (1985) A simple heuristic for the p-center problem. Oper Res Lett 3:285-288
Elloumi S, Labbé M, Pochet Y (2004) A new formulation and resolution method for the p-center
problem. INFORMS J Comput 16:84-94
Garfinkel R, Neebe A, Rao M (1977) The m-center problem: minimax facility location. Manag Sci
23:1133-1142
Goldman AJ (1972) Minimax location of a facility in a network. Transp Sci 6:407-418
Hakimi SL (1964) Optimum locations of switching centers and the absolute centers and medians
of a graph. Oper Res 12:450-459
Hakimi SL (1965) Optimum distribution of switching centers in a communication network and
some related graph theoretic problems. Oper Res 13:462-475
Handler GY (1973) Minimax location of a facility in an undirected tree network. Transp Sci
7:287-293
Hansen P, Labbé M, Nicloas B (1991) The continuous center set of a network. Discrete Appl Math
30:181-195
Hochbaum DS, Shmoys DB (1985) A best possible heuristic for the k-center problem. Math Oper
Res 10:180-184
