A perspective on location science

Location Science - Tập 5 - Trang 3-13 - 1997
Charles Revelle1
1Department of Geography and Environmental Engineering, The John Hopkins University, Baltimore, MD 21218-2686, USA

Tài liệu tham khảo

Arquilla, 1995, Graphing an optimal grand strategy, Military Operations Research, Fall, 3, 10.5711/morj.1.3.3 Balinski, 1965, Integer Programming: Methods, uses, computations, Management Science, 12, 253, 10.1287/mnsc.12.3.253 Baumol, 1958, A warehouse-location problem, Operations Research, 6, 252, 10.1287/opre.6.2.252 Berger, 1997, Modelling and Solving Location — Routing Problems Church, 1993, Maximal covering tree problems, Naval Research Logistics, 4, 129, 10.1002/1520-6750(199302)40:1<129::AID-NAV3220400109>3.0.CO;2-T Church, 1996, Reserve selection as a maximal covering location problem, Biological Conservation, 76, 105, 10.1016/0006-3207(95)00102-6 Cooper, 1963, Location-allocation problems, Operations Research, 11, 331, 10.1287/opre.11.3.331 Daskin, 1983, A maximum expected covering location model formulation, properties and heuristic solution, Transportation Science, 17, 48, 10.1287/trsc.17.1.48 Davis and Ray, 1969. Erkut, 1996, Integer-friendly formulations for the r-separation problem, European Journal of Operational Research, 92, 342, 10.1016/0377-2217(94)00348-3 Heller, 1989, The use of simulation in validating a multi-objective EMS location model, Annals of Operations Research, 18, 303, 10.1007/BF02097810 Hogan, 1986, Concepts and applications of backup coverage, Management Science, 32, 1434, 10.1287/mnsc.32.11.1434 Holmborg, 1994, Solving the staircase cost-facility location problem with decomposition and piecewise linearization, European Journal of Operational Research, 75, 41, 10.1016/0377-2217(94)90184-8 Hoover, 1948, The Location of Economic Activity Hotelling, 1929, Stability in competition, Economic Journal, 39, 41, 10.2307/2224214 Isard, 1956 Kuhn, 1962, An efficient algorithm for the numerical solution of the generalized Weber problem in spatial economics, Journal of Regional Science, 4, 21, 10.1111/j.1467-9787.1962.tb00902.x Land, 1960, An automatic method of solving discrete programming problems, Econometrica, 28, 497, 10.2307/1910129 Osman, 1995, 407 Maranzana, 1964, On the location of supply points to minimize transport costs, Operations Research Quarterly, 15, 261, 10.1057/jors.1964.47 Marianov, 1991, The standard response fire protection siting model, INFOR, 29, 116 Marianov, 1992, A probabilistic fire protection siting model with joint vehicle reliability requirements, Papers in Regional Science, 71, 217, 10.1007/BF01434265 Mesa, 1996, A review of extensive facility location in networks, European Journal of Operational Research, 95, 592, 10.1016/0377-2217(95)00321-5 Miehle, 1958, Link-length minimization in networks, Operations Research, 6, 232, 10.1287/opre.6.2.232 Morris, 1978, On the extent to which certain fixed charge depot location problems can be solved by LP, Journal of the Operational Research Society, 29, 71, 10.1057/jors.1978.10 ReVelle, 1989, The Maximum availability location problem, Transportation Science, 23, 192, 10.1287/trsc.23.3.192 ReVelle, 1996, The Plant Location Problem: New Models and Research Prospects, Operations Research, 44, 864, 10.1287/opre.44.6.864 ReVelle, 1991, A probabilistic FLEET model with individual vehicle reliability requirements, European Journal of Operational Research, 53, 93, 10.1016/0377-2217(91)90095-D ReVelle, 1993, Facility siting and integer friendly programming, European Journal of Operational Research, 65, 147, 10.1016/0377-2217(93)90329-L ReVelle, 1996, A shortest path model for the optimal timing of forest harvest decisions, Environment and Planning, B 23, 165, 10.1068/b230165 Rosing, K. (1981) Personal Communication, June. Rosing, 1991, Towards the solution of the (generalized) multi-Weber problem, Environment and Planning B, Planning and Design, 18, 347, 10.1068/b180347 Rosing, 1997, Heuristic concentration: Two stage solution construction, European Journal of Operational Research, 97, 75, 10.1016/S0377-2217(96)00100-2 Serra, 1994, Market capture by two competitors: The pre-emptive location problem, Journal of Regional Science, 34, 549, 10.1111/j.1467-9787.1994.tb00882.x Snyder, 1996, The grid packing problem, Forest Science, 42, 27 Snyder, 1997, Dynamic selection of harvests with adjacency restrictions: the SHARE model, Forest Science Snyder, 1996, Temporal and spatial harvesting of irregular parcel systems, Canadian Journal of Forest Research, 26, 1079, 10.1139/x26-119 Sylvester, 1857, A question in the geometry of situation, Quarterly Journal of Mathematics, 1, 79 Teitz, 1968, Heuristic methods for estimating the generalized vertex median of a weighted graph, Operations Research, 16, 955, 10.1287/opre.16.5.955 Weber, 1957 Weiszfeld, 1937, Sur le point lequal la somme des distances de n points donnés est minimum, The Tohoku Mathematical Journal, 43, 335 Wersan, 1962, American Public Works Yearbook Wesolowsky, 1993, The Weber problem: History and perspectives, Location Science, 1, 5 Williams, 1996, A 0–1 programming approach to delineating protected reserves, Environment and Planning, B 23, 607, 10.1068/b230607 Williams, 1997, Reserve assemblage of critical areas: A 0–1 programming approach, European Journal of Operational Research