A spanning tree approach to the absolute p-center problem

Location Science - Tập 6 - Trang 83-107 - 1998
Burçin Bozkaya1, Barbaros Tansel2
1Faculty of Business, University of Alberta, Edmonton AB, Canada T6G 2R6
2Department of Industrial Engineering, Bilkent University, Bilkent, Ankara, 06533, Turkey

Tài liệu tham khảo

Beasley, 1990, OR-Library: distributing test problems by electronic mail, J. Oper. Res. Soc., 41, 1069, 10.1057/jors.1990.166 Busacker, R.G., Saaty, T.L., 1965. Finite Graphs and Networks. McGraw-Hill, New York Chandrasekaran, 1981, Location on tree networks: p-centre and N-dispersion problems, Math. Oper. Res., 6, 50, 10.1287/moor.6.1.50 Chandrasekaran, 1980, An O((nlogp)2) algorithm for the continuous p-center problem on a tree, SIAM J. Algebraic Discrete Meth., 1, 370, 10.1137/0601043 Cristofides, 1971, The optimum location of multi-centers on a graph, Oper. Res. Quart., 22, 145, 10.1057/jors.1971.32 Dearing, 1974, A minimax location problem on a network, Transportation Sci., 8, 333, 10.1287/trsc.8.4.333 Hakimi, 1964, Optimal locations of switching centers and the absolute centers and medians of a graph, Oper. Res., 12, 450, 10.1287/opre.12.3.450 Hakimi, 1965, Optimum distribution of switching centers in a communication network and some related graph theoretic problems, Oper. Res., 13, 462, 10.1287/opre.13.3.462 Hakimi, 1978, On p-centers in networks, Transportation Sci., 12, 1, 10.1287/trsc.12.1.1 Handler, 1973, Minimax location of a facility in an undirected tree graph, Transportation Sci., 7, 287, 10.1287/trsc.7.3.287 Handler, 1978, Finding two-centers of a tree; the continuous case, Transportation Sci., 12, 93, 10.1287/trsc.12.2.93 Hedetniemi, 1981, Linear algorithms for finding the jordan center and path center of a tree, Transportation Sci., 15, 98, 10.1287/trsc.15.2.98 Hochbaum, 1997, Generalized p-center problems: Complexity results and approximation algorithms, European J. Oper. Res., 100, 594, 10.1016/S0377-2217(96)00076-8 Hochbaum, 1985, A best possible heuristic for the k-center problem, Math. Oper. Res., 10, 180, 10.1287/moor.10.2.180 Hooker, 1986, Solving nonlinear single-facility network location problems, Oper. Res., 34, 732, 10.1287/opre.34.5.732 Hooker, 1989, Solving nonlinear multiple-facility network location problems, Networks, 19, 117, 10.1002/net.3230190110 Hooker, 1991, Finite dominating sets for network location problems, Oper. Res., 39, 100, 10.1287/opre.39.1.100 Kariv, 1979, An algorithmic approach to network location problems. Part I: The p-centers, SIAM J. Appl. Math., 37, 513, 10.1137/0137040 Kirchoff, 1847, Über die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Verteilung galvanischer Ströme gefürt wird, Ann. Phys. Chem., 72, 497, 10.1002/andp.18471481202 Megiddo, 1981, An O(nlog2n) algorithm for the kth longest path in a tree with applications to location problems, SIAM J. Computing, 10, 328, 10.1137/0210023 Minieka, 1970, The m-center problem, SIAM Rev., 12, 138, 10.1137/1012016 Minieka, 1980, Conditional centers and medians of a graph, Networks, 10, 265, 10.1002/net.3230100307 Minieka, 1981, A polynomial time algorithm for finding the absolute center of a network, Networks, 11, 351, 10.1002/net.3230110404 Mirchandani, P.B., Francis, R.L. (Eds.), 1990. Discrete Location Theory. Wiley, New York Moon, J.W., 1967. Various proofs of Cayley’s formula for counting trees. In: Harary, F., Beineke, L. (Eds.), A Seminar on Graph Theory. Holt, Rinehart & Winston, New York Plesnik, 1987, A heuristic for the p-center problem in graphs, Discrete Appl. Math., 17, 263, 10.1016/0166-218X(87)90029-1 Riordan, J., 1958. An Introduction to Combinatorial Analysis. Wiley, New York Tamir, 1985, A finite algorithm for the continuous p-center location problem on a graph, Math. Programming, 31, 298, 10.1007/BF02591951 Tansel, 1983, Location on networks: A survey, Part I: the p-center and p-median problems, Management Sci., 29, 482, 10.1287/mnsc.29.4.482 Tansel, B.C., Francis, R.L., Lowe, T.J., 1990. Duality: Covering and constraining p-center problems on trees. In: Mirchandani, P.B., Francis, R.L. (Eds.), Discrete Location Theory. Wiley Interscience, New York, pp. 349–386 Tansel, 1982, Duality and distance constraints for the non-linear p-center problem and covering problem on a tree network, Oper. Res., 30, 725, 10.1287/opre.30.4.725 Thulasiraman, K., Swamy, M.N.S., 1992. Graphs: Theory and Algorithms. Wiley Interscience, New York Toregas, 1971, The location of emergency service facilities, Oper. Res., 19, 1363, 10.1287/opre.19.6.1363