Chapter 7 Location on Networks

Handbooks in Operations Research and Management Science

Volumn 8, Issue C, 1995, Pages 551-624

  Labbé, Martine ^a   Peeters, Dominique ^b   Thisse, Jacques François ^c  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^c UNIVERSITÉ PARIS 1 PANTHÉON SORBONNE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77957101066     PISSN: 09270507     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0927-0507(05)80111-2     Document Type: Review

References (187)

1. Aardal, K., On the Solution of One and Two-Level Capacitated Facility Location Problems by the Cutting Plane Approach. Unpublished Ph.D. Thesis, Université Catholique de Louvain, Faculté des Sciences Appliquées, 1992.
2. Ahn, S., Cooper, C., Cornuéjols, G., Frieze, A.M., Probabilistic analysis of a relaxation for the k-median problem. Math. Oper. Res. 13 (1988), 1–31.
3. Balas, E., A class of location, distribution and scheduling problems: modeling of solution methods. Rev. Belge Statistique, Inf. Rech. Opér. 82 (1982), 36–69.
4. Balas, E., Ng, S.M., On the set covering polytope: II. Lifting the facets with coefficients in {0, 1, 2}. Math. Program. 45 (1989), 1–20.
5. Balinski, M.L., On finding integer solutions to linear programs. Proc. IBM Scientific Symp. on Combinatorial Problems, 1966, White Plains, NY, IBM Data Processing Division, Montréal.
6. Bandelt, H.-J., Networks with Condorcet solutions. Eur. J. Oper. Res. 20 (1985), 314–326.
7. mimeo Bandelt, H.-J., Centroids and medians of finite metric spaces. 1990.
8. Bandelt, H.-J., Labbé, M., How bad can a voting location be?. Social Choice and Welfare 3 (1986), 125–145.
9. Barthélemy, J.-P., Caractérisation médiane des arbres. Ann. Discrete Math. 17 (1983), 39–46.
10. Batta, R., Single server queueing-location models with rejection. Transp. Sci. 22 (1988), 209–216.
11. Batta, R., A queueing-location model with expected service time dependent queueing disciplines. Eur. J. Oper. Res. 39 (1989), 192–205.
12. Batta, R., Palekar, U.S., Mixed planar/network facility location problems. Comput. Oper. Res. 15 (1988), 61–67.
13. Beckmann, M.J., Thisse, J.-F., The location of production activities. Mills, E.S., Nijkamp, P., (eds.) Handbook of Regional and Urban Economics, 1986, North-Holland, Amsterdam, 21–95.
14. Ben-Akiva, M., Lerman, S., Discrete Choice Analysis: Theory and Applications to Predict Travel Demand. 1985, MIT Press, Amsterdam.
15. Berge, C., Espaces topologiques. Fonctions multivoques. 1966, Dunod, Cambridge, MA.
16. Berge, C., Théorie des graphes et ses applications. 1967, Dunod, Paris.
17. Berman, O., Chiu, S.S., Larson, R.C., Odoni, A.R., Batta, R., Location of mobile units in a stochastic environment. Mirchandani, P.B., Francis, R.L., (eds.) Discrete Location Theory, 1990, Wiley, Paris, 503–549.
18. Berman, O., Larson, R.C., Chiu, S.S., Optimal server location on a network operating as an M/G/1 queue. Oper. Res. 33 (1985), 746–771.
19. Berman, O., Simchi-Levi, D., Minisum location of a traveling salesman. Networks 16 (1986), 239–254.
20. Berman, O., Simchi-Levi, D., Finding the optimal a priori tour and location of a traveling salesman with non homogeneous customers. Transp. Sci. 22 (1988), 148–154.
21. Berman, O., Simchi-Levi, D., Minisum location of a travelling salesman on simple networks. Eur. J. Oper. Res. 36 (1988), 241–250.
22. Berman, O., Simchi-Levi, D., Tamir, A., The minimax multistop location problem on a tree. Networks 18 (1988), 39–49.
23. Bertsimas, D.J., Traveling salesman facility location problems. Transp. Sci. 23 (1989), 184–191.
24. Bilde, O., Krarup, J., Sharp lower bounds and efficient algorithms for the simple plant location problem. Ann. Discrete Math. 1 (1977), 79–97.
25. Brandeau, M.L., Chiu, S.S., An overview of representative problems in location research. Manage. Sci. 35 (1989), 645–674.
26. Brandeau, M.L., Chiu, S.S., A unified family of queueing location models. Oper. Res. 38 (1990), 1034–1044.
27. Buckley, F., Miller, Z., Slater, P.J., On graphs containing a given graph as center. J. Graph Theory 5 (1981), 427–434.
28. Chen, M.L., Francis, R.L., Lowe, T.J., The 1-center problem: Exploiting block structure. Transp. Sci. 22 (1988), 259–269.
29. Chen, M.L., Francis, R.L., Lawrence, J.F., Lowe, T.J., Tufekci, S., Block-vertex duality and the one-median problem. Networks 15 (1985), 395–412.
30. Chiu, S.S., A dominance theorem for the stochastic queue median problem. Oper. Res. 34 (1986), 942–944.
31. Chiu, S.S., Optimal M/G/1 server location on a tree network with continuous link demands. Comput. Oper. Res. 13 (1986), 653–669.
32. Chiu, S.S., The minisum location problem on an undirected network with continuous link demands. Comput. Oper. Res. 14 (1987), 369–383.
33. Chiu, S.S., Berman, O., Larson, R.C., Locating a mobile server queueing facility on a tree network. Manage. Sci. 31 (1985), 764–772.
34. Cho, D.C., Johnson, E.L., Padberg, M.W., Rao, M.R., On the uncapacitated plant location problem. I. Valid inequalities and facets. Math. Oper. Res. 8 (1983), 579–589.
35. Cho, D.C., Padberg, M.W., Rao, M.R., On the uncapacitated plant location problem. II. Facets and lifting theorems. Math. Oper. Res. 8 (1983), 590–612.
36. Christofides, N., Graph Theory: An Algorithmic Approach. 1975, Academic Press, New York, NY.
37. Christofides, N., Viola, P., The optimal location of multi-centers on a graph. Oper. Res. Q. 22 (1971), 145–154.
38. Christofides, N., Beasley, J.E., A tree search algorithm for the p-median problem. Eur. J. Oper. Res. 10 (1982), 196–204.
39. Church, R.L., Meadows, M.E., Location modelling utilizing maximum service distance criteria. Geogr. Anal. 11 (1979), 358–373.
40. Church, R.L., ReVelle, C.S., The maximal covering location problem. Pap. Reg. Sci. Assoc. 32 (1974), 101–118.
41. Cornuéjols, G., Fisher, M.L., Nemhauser, G.L., Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms. Manage. Sci. 23 (1977), 789–810.
42. Cornuéjols, G., Fisher, M.L., Nemhauser, G.L., On the uncapacitated location problem. Ann. Discrete Math. 1 (1977), 163–177.
43. Cornuéjols, G., Nemhauser, G.L., Wolsey, L.A., The uncapacitated facility location problem. Mirchandani, P.B., Francis, R.L., (eds.) Discrete Location Theory, 1990, Wiley, New York, NY, 119–171.
44. Cornuéjols, G., Sassano, A., On the 0, 1 facets of the set covering polytope. Math. Program. 43 (1989), 45–55.
45. Cornuéjols, G., Sridharam, R., Thizy, J.M., A comparison of heuristics and relaxations for the capacitated plant location problem. Eur. J. Oper. Res. 50 (1991), 280–297.
46. Cornuéjols, G., Thizy, J.M., Some facets of the simple plant location polytope. Math. Program. 23 (1982), 50–74.
47. Cuninghame-Green, R.A., The absolute center of a graph. Discrete Appl. Math. 7 (1984), 275–283.
48. Dear, M., Planning for mental health care: a reconsideration of public facility location theory. Int. Reg. Sci. Rev. 3 (1978), 93–111.
49. Dearing, P.M., Minimax location problems with nonlinear costs. J. Res. Nat. Bur. Stand. 82 (1977), 65–72.
50. Dearing, P.M., Francis, R.L., A minimax location problem on a network. Transp. Sci. 8 (1974), 333–343.
51. Dearing, P.M., Francis, R.L., Lowe, T.J., Convex location problems on tree networks. Oper. Res. 24 (1976), 628–642.
52. Demange, G., Spatial models of collective choice. Thisse, J.-F., Zoller, H.G., (eds.) Locational Analysis of Public Facilities, 1983, North-Holland, New York, NY, 153–182.
53. Domschke, W., Drexl, A., Location and Layout Planning: An International Bibliography. 1985, Springer Verlag, Amsterdam.
54. Domschke, W., Drexl, A., ADD- and DROP- procedures for capacitated plant location with different capacities. Eur. J. Oper. Res. 21 (1985), 47–53.
55. Dyer, M.E., Frieze, A.M., A simple heuristic for the p-centre problem. Oper. Res. Lett. 3 (1985), 285–288.
56. Edgeworth, F.Y., The method of least squares. Philos. Mag. 16 (1883), 360–375.
57. Eiselt, H.A., Laporte, G., Locational equilibrium of two facilities on a tree. RAIRO Rech. Opér. 25 (1991), 5–17.
58. Eiselt, H.A., Laporte, G., The existence of equilibria in the 3-facility Hotelling model in a tree. Transp. Sci. 27 (1993), 39–43.
59. Eiselt, H.A., Laporte, G., Thisse, J.-F., Competitive location models: a framework and bibliography. Transp. Sci. 27 (1993), 44–54.
60. Erkut, E., Neuman, S., Analytical models for locating undesirable facilities. Eur. J. Oper. Res. 40 (1989), 275–291.
61. Erkut, E., Tansel, B.C., On parametric medians of trees. 1989, Department of Finance and Management Science, University of Alberta, Berlin.
62. Erlenkotter, D., Facility location with price-sensitive demands: private, public, and quasipublic. Manage. Sci. 24 (1977), 378–386.
63. Erlenkotter, D., A dual-based procedure for uncapacitated facility location. Oper. Res. 26 (1978), 992–1009.
64. Federgruen, A., Tzur, M., A simple forward algorithm to solve general dynamic lot sizing models with n periods in O(n logn) or O(n) time. Manage. Sci. 37 (1991), 909–925.
65. Feldman, E., Lehrer, F.A., Ray, T.L., Warehouse locations under continuous economies of scale. Manage. Sci. 12 (1966), 670–684.
66. Fisher, M.L., Worst-case analysis of heuristic algorithms. Manage. Sci. 26 (1980), 1–18.
67. Fotheringham, A.S., O'Kelly, M.E., Spatial Interaction Models: Formulations and Specifications. 1989, Kluwer, Dordrecht.
68. Francis, R.L., A note on a nonlinear minimax location problem in a tree network. J. Res. Nat. Bur. Stand. 82 (1977), 73–80.
69. Francis, R.L., McGinnis, L.F., White, J.A., Facility Layout and Location: An Analytical Approach. 1992, Prentice Hall, Dordrecht.
70. Frank, H., A note on a graph theoretic game of Hakimi's. Oper. Res. 15 (1967), 567–570.
71. Friedman, J., Game Theory with Applications to Economics. 1990, Oxford University Press, Englewood Cliffs, NJ.
72. Friesz, T.L., Miller, T., Tobin, R.L., Competitive network facility location models. Pap. Reg. Sci. Assoc. 65 (1988), 47–57.
73. Gabszewicz, J., Thisse, J.-F., Location. Aumann, R., Hart, S., (eds.) Handbook of Game Theory with Economic Applications, 1992, North-Holland, Oxford, 281–304.
74. Geoffrion, A.M., McBride, R., Lagrangian relaxation applied to facility location problems. AIIE Trans. 10 (1978), 40–47.
75. Goldman, A.J., Optimal center location in simple networks. Transp. Sci. 5 (1971), 212–221.
76. Goldman, A.J., Approximate localization theorems for optimal facility placement. Transp. Sci. 6 (1972), 195–201.
77. Goldman, A.J., Minimax location of a facility in a network. Transp. Sci. 6 (1972), 407–418.
78. Goldman, A.J., Witzgall, C.J., A localization theorem for optimal facility placement. Transp. Sci. 4 (1970), 406–409.
79. Guignard, M., Fractional vertices, cuts and facets of the simple plant location problem. Math. Program. Study 12 (1980), 150–162.
80. Guignard, M., Spielberg, K., A direct dual method for the mixed plant location problem with some side constraints. Math. Program. 17 (1979), 198–228.
81. Gülicher, H., Some early contributions to minisum location theory. 1987, Institut für Ökonometrie und Wirtschaftsstatistik, Universität ünchen, Amsterdam.
82. Hakimi, S.L., Optimum locations of switching centers and the absolute centers and medians of a graph. Oper. Res. 12 (1964), 450–459.
83. Hakimi, S.L., Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Oper. Res. 13 (1965), 462–475.
84. Hakimi, S.L., On locating new facilities in a competitive environment. Eur. J. Oper. Res. 12 (1983), 29–35.
85. Hakimi, S.L., Schmeichel, E.F., Pierce, J.G., On p-centers in networks. Transp. Sci. 12 (1978), 1–15.
86. Halfin, S., On finding the absolute and vertex center of a tree with distances. Transp. Sci. 8 (1974), 75–77.
87. Halpern, J., The location of a cent-dian convex combination on an undirected tree. J. Reg. Sci. 16 (1976), 237–245.
88. Halpern, J., Finding minimal center-median convex combination (cent-dian) of a graph. Manage. Sci. 24 (1978), 534–544.
89. Halpern, J., Duality in the cent-dian of a graph. Oper. Res. 28 (1980), 722–735.
90. Halpern, J., Maimon, O., Algorithms for the m-center problems: A survey. Eur. J. Oper. Res. 10 (1982), 90–99.
91. Handler, G.Y., Minimax location of a facility in an undirected tree graph. Transp. Sci. 7 (1973), 293–297.
92. Handler, G.Y., Mirchandani, P.B., Location on Networks: Theory and Algorithms. 1979, MIT Press, Cambridge, MA.
93. Handler, G.Y., p-center problems. Mirchandani, P.B., Francis, R.L., (eds.) Discrete Location Theory, 1990, Wiley, Cambridge, MA, 305–347.
94. Hanjoul, P., Hansen, P., Peeters, D., Thisse, J.-F., Uncapacitated plant location under alternative spatial price policies. Manage. Sci. 36 (1990), 41–57.
95. Hanjoul, P., Peeters, D., Comparison of two dual-based procedures for solving the p-median problem. Eur. J. Oper. Res. 20 (1985), 387–396.
96. Hanjoul, P., Peeters, D., A facility location problem with client's preference orderings. Reg. Sci. Urban Econ. 17 (1987), 451–473.
97. Hanjoul, P., Thisse, J.-F., The location of a firm on a network. Hughes-Hallet, A.J., (eds.) Applied Decision Analysis and Economic Behaviour, 1984, M. Nijhoff, New York, NY, 289–326.
98. Hansen, P., Labbé, M., Algorithms for voting and competitive location on a network. Transp. Sci. 22 (1988), 278–288.
99. Hansen, P., Labbé, M., The continuous p-median of a network. Networks 19 (1989), 595–606.
100. Hansen, P., Labbé, M., Nicolas, B., The continuous center set of a network. Discrete Appl. Math. 30 (1991), 181–195.
101. Hansen, P., Labbé, M., Thisse, J.-F., From the median to the generalized center. RAIRO Rech. Opér. 25 (1991), 73–86.
102. Hansen, P., Labbé, M., Peeters, D., Thisse, J.-F., Single facility location on networks. Ann. Discrete Math. 31 (1987), 113–146.
103. Hansen, P., Labbé, M., Peeters, D., Thisse, J.-F., Facility location analysis. Fundam. Pure Appl. Econ. 22 (1987), 1–70.
104. Hansen, P., Peeters, D., Thisse, J.-F., Public facility location models: A selective survey. Thisse, J.-F., Zoller, H.G., (eds.) Locational Analysis of Public Facilities, 1983, North-Holland, Den Haag, 223–262.
105. Hansen, P., Peeters, D., Thisse, J.-F., Facility location under zonal pricing. 1992, GERAD, Université de Montréal, Amsterdam.
106. Hansen, P., Roberts, F.S., An impossibility result in axiomatic location theory. 1991, RUTCOR, Rutgers University.
107. Hansen, P., Thisse, J.-F., Multiplant location for profit maximisation. Environment and Planning A 9 (1977), 63–73.
108. Hansen, P., Thisse, J.-F., Outcomes of voting and planning: Condorcet, Weber, and Rawls locations. J. Public Econ. 16 (1981), 1–15.
109. Hansen, P., Thisse, J.-F., Hanjoul, P., Simple plant location under uniform delivered pricing. Eur. J. Oper. Res. 6 (1981), 94–103.
110. Hansen, P., Thisse, J.-F., Wendell, R.E., Efficient points on a network. Networks 16 (1986), 358–367.
111. Hansen, P., Thisse, J.-F., Wendell, R.E., Equivalence of solutions to network location problems. Math. Oper. Res. 11 (1986), 672–678.
112. Hassin, R., Tamir, A., Improved complexity bounds for location problems on the real line. Oper. Res. Letters 10 (1991), 395–402.
113. Hedetniemi, S.M., Cockayne, E.J., Hedetniemi, S.T., Linear algorithms for finding the Jordan center and path center of a tree. Transp. Sci. 15 (1981), 98–114.
114. Hochbaum, D.S., Shmoys, D.B., A best possible heuristic for the k-center problem. Math. Oper. Res. 10 (1985), 180–184.
115. Holzman, R., An axiomatic approach to location on networks. Math. Oper. Res. 15 (1990), 553–563.
116. Hooker, J.N., Solving nonlinear single-facility network location problems. Oper. Res. 34 (1986), 732–743.
117. Hooker, J.N., Garfinkel, R.S., Chen, C.K., Finite dominating sets for network location problems. Oper. Res. 39 (1991), 100–118.
118. Jacobsen, S.K., Heuristics for the capacitated plant location model. Eur. J. Oper. Res. 12 (1983), 253–261.
119. Johansen, L., On the status of the Nash type of noncooperative equilibrium in economic theory. Scand. J. Econ. 84 (1982), 421–441.
120. Johnson, D.S., Papadimitriou, C.H., Performance guarantees for heuristics. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B., (eds.) The travelling Salesman Problem, 1985, Wiley, New York, NY, 87–143.
121. Jordan, C., Sur les assemblages de lignes. Z. Reine Angew. Math. 70 (1869), 185–190.
122. Kariv, O., Hakimi, S.L., An algorithmic approach to network location problems, I: The p-centers. SIAM J. Appl. Math. 37 (1979), 513–538.
123. Kariv, O., Hakimi, S.L., An algorithmic approach to network location problems, II: The p-medians. SIAM J. Appl. Math. 37 (1979), 539–560.
124. Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P., Optimization by simulated annealing. Science 220 (1983), 671–680.
125. Kleinrock, L., Queueing Systems., Vol. 1, 1975, Wiley, New York, NY.
126. Kolen, A., Solving covering problems and the uncapacitated plant location problem on trees. Eur. J. Oper. Res. 12 (1983), 266–278.
127. Körkel, M., On the exact solution of large-scale simple plant location problems. Eur. J. Oper. Res. 39 (1989), 157–173.
128. Krarup, J., Pruzan, P.M., The simple plant location problem: Survey and synthesis. Eur. J. Oper. Res. 12 (1983), 36–81.
129. Kuehn, A.A., Hamburger, M.J., A heuristic program for locating warehouses. Manage. Sci. 9 (1963), 643–666.
130. Labbé, M., Outcomes of voting and planning in single facility location problems. Eur. J. Oper. Res. 20 (1985), 299–313.
131. Labbé, M., Hakimi, S.L., Market and locational equilibrium for two competitors. Oper. Res. 39 (1991), 749–756.
132. Labbé, M., Thisse, J.-F., Wendell, R.E., Sensitivity analysis in minisum facility location problems. Oper. Res. 39 (1991), 961–969.
133. Laporte, G., Location-routing problems. Golden, B.L., Assad, A.A., (eds.) Vehicle Routing: Methods and Studies, 1988, North Holland, New York, NY, 163–198.
134. columns Launhardt, W., Die Bestimmung des Zwechkmässigsten Standortes einer Gewerblichten Anlage. Z. Ver. Dtsch. Ing. 26 (1882), 105–116.
135. Lederer, P.J., Thisse, J.-F., Competitive location on networks under delivered pricing. Oper. Res. Lett. 9 (1990), 147–153.
136. Leonardi, G., The use of random-utility theory in building location-allocation models. Thisse, J.-F., Zoller, H.G., (eds.) Locational Analysis of Public Facilities, 1983, North-Holland, Amsterdam, 357–383.
137. Leung, J.M.Y., Magnanti, T.L., Valid inequalities and facets of the capacitated plant location problem. Math. Program. 44 (1989), 271–291.
138. Levy, J., An extended theorem for location on a network. Oper. Res. Q. 18 (1967), 433–442.
139. Lin, C.C., On vertex addends in minimax location problems. Transp. Sci. 9 (1975), 165–168.
140. Louveaux, F., Thisse, J.-F., Beguin, H., Location theory and transportation costs. Reg. Sci. Urban Econ. 12 (1982), 529–545.
141. Love, R.F., Morris, J.G., Wesolowsky, G.O., Facilities Location. 1988, North-Holland, Amsterdam.
142. Magnanti, T.L., Wong, R.T., Decomposition methods for facility location problems. Mirchandani, P.B., Francis, R.L., (eds.) Discrete Location Theory, 1990, Wiley, Amsterdam, 209–262.
143. Manne, A.S., Plant location under economies-of-scale — Decentralization and computation. Manage. Sci. 11 (1964), 213–235.
144. Maranzana, F.E., On the location of supply points to minimize transport costs. Oper. Res. Q. 15 (1964), 261–270.
145. Martello, S., Toth, P., Knapsack Problems: Algorithms and Computer Implementations. 1990, Wiley, New York, NY.
146. Matula, D.W., Kolde, R., Efficient multimedian location in a cyclic networks. ORSA/TIMS Meeting, Miami, FL, 1976.
147. 3 and related problems. SIAM J. Comput. 12 (1983), 759–776.
148. Megiddo, N., Tamir, A., New results on the complexity of p-center problems. SIAM J. Comput. 12 (1983), 751–758.
149. Minieka, E., The m-center problem. SIAM Rev. 12 (1970), 138–139.
150. Minieka, E., The centers and medians of a graph. Oper. Res. 25 (1977), 641–650.
151. Minieka, E., A polynomial time algorithm for finding the absolute center of a network. Networks 11 (1981), 351–355.
152. Mirchandani, P.B., Francis, R.L., (eds.) Discrete Location Theory, 1990, Wiley, New York, NY.
153. Mirchandani, P.B., Odoni, A.R., Location of medians on stochastic networks. Transp. Sci. 13 (1979), 85–95.
154. Morris, J.G., On the extent to which certain fixed-charge depot location problems can be solved by LP. J. Oper. Res. Soc. 29 (1978), 71–76.
155. Mulligan, G.F., Equality measures and facility location. Pap. Reg. Sci. 70 (1991), 345–365.
156. Narula, S.C., Ogbu, U.I., Samuelsson, H.M., An algorithm for the p-median problem. Oper. Res. 25 (1977), 709–713.
157. Nauss, R.M., An improved algorithm for the capacitated facility location problem. J. Oper. Res. Soc. 29 (1978), 1195–1201.
158. Nemhauser, G.L., Wolsey, L.A., Integer and Combinatorial Optimization. 1988, Wiley, New York, NY.
159. Nemhauser, G.L., Wolsey, L.A., Fisher, M.L., An analysis of approximations for maximising submodular set functions. I. Math. Program. 14 (1978), 265–294.
160. Nobili, P., Sassano, A., Facets and lifting procedures for the set covering polytope. Math. Program 45 (1989), 111–137.
161. Padberg, M.W., On the facial structure of set packing polyhedra. Math. Program. 5 (1973), 199–215.
162. Rawls, J., A Theory of Justice. 1971, Harvard University Press, New York, NY.
163. ReVelle, C.S., Swain, R., Central facilities location. Geogr. Anal. 2 (1970), 30–42.
164. Rosenhead, J.V., The optimum location of transverse transport links. Transp. Res. 7 (1973), 107–123.
165. Rushton, G., McLafferty, S., Ghosh, A., Equilibrium locations for public services: individual preferences and social choice. Geogr. Anal. 13 (1981), 196–202.
166. Sassano, A., On the facial structure of the set covering polytope. Math. Program. 43 (1989), 45–55.
167. Schrage, L., Implicit representation of variable upper bounds in linear programming. Math. Program. Studies 44 (1975), 181–202.
168. Shier, D.R., Dearing, P.M., Optimal locations for a class of nonlinear, single-facility location problems on a network. Oper. Res. 31 (1983), 292–303.
169. Simchi-Levi, D., Berman, O., A heuristic algorithm for the traveling salesman location problem on networks. Oper. Res. 36 (1988), 478–484.
170. Slater, P.J., Maximin facility location. J. Res. Nat. Bur. Stand. B79 (1975), 107–115.
171. Slater, P.J., Medians of arbitrary graphs. J. Graph Theory 4 (1980), 389–392.
172. Stollsteimer, J.F., A working model for plant numbers and locations. J. Farm Econ. 45 (1963), 631–645.
173. Tamir, A., On the solution value of the continuous p-center location problem on a graph. Math. Oper. Res. 12 (1987), 340–349.
174. Tamir, A., Improved complexity bounds for center location problems on networks by using dynamic data structures. SIAM J. Discrete Math. 1 (1988), 377–396.
175. Tansel, B.C., Francis, R.L., Lowe, T.J., Location on networks: A survey — Part I: The p-center and p-median problems. Manage. Sci. 29 (1983), 482–497.
176. Tansel, B.C., Francis, R.L., Lowe, T.J., Location on networks: A survey — Part II: Exploiting the tree network structure. Manage. Sci. 29 (1983), 498–511.
177. Teitz, M.B., Bart, P., Heuristic methods for estimating the generalized vertex median of a weighted graph. Oper. Res. 16 (1968), 955–961.
178. Van Roy, T.J., A cross decomposition algorithm for capacitated facility location. Oper. Res. 34 (1986), 145–163.
179. Varian, H.R., Microeconomic Analysis. 1984, Norton, Cambridge, MA.
180. Vohra, R.V., Distance weighted voting and a single facility location problem. Eur. J. Oper. Res. 41 (1989), 314–320.
181. Wagelmans, A.P.M., van Hoesel, C.P.M., Kolen, A.W.J., Economic lot-sizing: an O(n log n)-algorithm that runs in linear time in the Wagner-Whitin case. Oper. Res. 40 (1992), S145–S156.
182. Weaver, J.R., Church, R.L., A median location problem with nonclosest facility service. Transp. Sci. 7 (1985), 18–23.
183. Weber, A., Ueber den Standort der Industrien. 1909, J.C.B. Mohr, New York, NY.
184. Wendell, R.E., Hurter, A.P., Optimal locations on a network. Transp. Sci. 7 (1973), 18–33.
185. Wendell, R.E., McKelvey, R.D., New perspectives in competitive location theory. Eur. J. Oper. Res. 6 (1981), 174–182.
186. Witzgall, C., Optimal location of a central facility: mathematical models and concepts. Report 8388, 1964, National Bureau of Standards, Tübingen.
187. Zelinka, B., Medians and the peripherians of trees. Archivum Math. 4 (1968), 87–95.