Skip to main content
SpringerLink
Log in

Continuous Location Problems

  • Chapter
  • First Online:
Contributions to Location Analysis

Part of the book series: International Series in Operations Research & Management Science ((ISOR,volume 281))

  • 512 Accesses

Abstract

In this chapter I summarize many papers (out of 75) co-authored with Zvi mostly on continuous location models in the plane. Other topics that are described in other chapters include: production processes, optimal control, and statistical methods.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Averbakh, I., Berman, O., Drezner, Z., & Wesolowsky, G. O. (1998). The plant location problem with demand-dependent setup cost and centralized allocation. European Journal of Operational Research, 111, 543–554.

    Article  Google Scholar 

  • Averbakh, I., Berman, O., Drezner, Z., & Wesolowsky, G. O. (2007). The uncapacitated facility location problem with demand-dependent setup and service costs and flexible allocation. European Journal of Operational Research, 179, 956–967.

    Article  Google Scholar 

  • Bagherinejad, J., Bashiri, M., & Nikzad, H. (2018). General form of a cooperative gradual maximal covering location problem. Journal of Industrial Engineering International, 14, 241–253.

    Article  Google Scholar 

  • Berman, O., Drezner, T., Drezner, Z., & Wesolowsky, G. O. (2009a). A defensive maximal covering problem on a network. International Transactions on Operational Research, 16, 69–86.

    Article  Google Scholar 

  • Berman, O., Drezner, Z., & Krass, D. (2011). Big segment small segment global optimization algorithm on networks. Networks, 58, 1–11.

    Article  Google Scholar 

  • Berman, O., Drezner, Z., Krass, D., & Wesolowsky, G. O. (2009b). The variable radius covering problem. European Journal of Operational Research, 196, 516–525.

    Article  Google Scholar 

  • Berman, O., Drezner, Z., Tamir, A., & Wesolowsky, G. O. (2009c). Optimal location with equitable loads. Annals of Operations Research, 167, 307–325.

    Article  Google Scholar 

  • Berman, O., Drezner, Z., Wang, J., & Wesolowsky, G. O. (2003a). The minimax and maximin location problems with uniform distributed weights. IIE Transactions, 35, 1017–1025.

    Article  Google Scholar 

  • Berman, O., Drezner, Z., & Wesolowsky, G. O. (1996). Minimum covering criterion for obnoxious facility location on a network. Networks, 18, 1–5.

    Article  Google Scholar 

  • Berman, O., Drezner, Z., & Wesolowsky, G. O. (2000). Routing and location on a network with hazardous threats. Journal of the Operational Research Society, 51, 1093–1099.

    Article  Google Scholar 

  • Berman, O., Drezner, Z., & Wesolowsky, G. O. (2001). Location models with groups of demand points on a network. IIE Transactions, 33, 637–648.

    Google Scholar 

  • Berman, O., Drezner, Z., & Wesolowsky, G. O. (2002a). The collection depots location problem on networks. Naval Research Logistics, 49, 15–24.

    Article  Google Scholar 

  • Berman, O., Drezner, Z., & Wesolowsky, G. O. (2002b). Satisfying partial demand in facilities location. IIE Transactions, 24, 971–978.

    Google Scholar 

  • Berman, O., Drezner, Z., & Wesolowsky, G. O. (2003b). The expected maximum distance objective in facility location. Journal of Regional Science, 43, 735–748.

    Article  Google Scholar 

  • Berman, O., Drezner, Z., & Wesolowsky, G. O. (2003c). The expropriation location problem. Journal of the Operational Research Society, 54, 769–776.

    Article  Google Scholar 

  • Berman, O., Drezner, Z., & Wesolowsky, G. O. (2003d). Locating service facilities whose reliability is distance dependent. Computers & Operations Research, 30, 1683–1695.

    Article  Google Scholar 

  • Berman, O., Drezner, Z., & Wesolowsky, G. O. (2005). The facility and transfer points location problem. International Transactions in Operational Research, 12, 387–402.

    Article  Google Scholar 

  • Berman, O., Drezner, Z., & Wesolowsky, G. O. (2007). The transfer point location problem. European Journal of Operational Research, 179, 978–989.

    Article  Google Scholar 

  • Berman, O., Drezner, Z., & Wesolowsky, G. O. (2008). The multiple location of transfer points. Journal of the Operational Research Society, 59, 805–811.

    Article  Google Scholar 

  • Berman, O., Drezner, Z., & Wesolowsky, G. O. (2009d). The maximal covering problem with some negative weights. Geographical Analysis, 41, 30–42.

    Article  Google Scholar 

  • Berman, O., Kalcsics, J., Krass, D., & Nickel, S. (2009e). The ordered gradual covering location problem on a network. Discrete Applied Mathematics, 157, 3689–3707.

    Article  Google Scholar 

  • Berman, O., Krass, D., & Drezner, Z. (2003e). The gradual covering decay location problem on a network. European Journal of Operational Research, 151, 474–480.

    Article  Google Scholar 

  • Berman, O., Wang, J., Drezner, Z., & Wesolowsky, G. O. (2003f). A probabilistic minimax location problem on the plane. Annals of Operations Research, 122, 59–70.

    Article  Google Scholar 

  • Brimberg, J., & Drezner, Z. (2015). A location-allocation problem with concentric circles. IIE Transactions, 47, 1397–1406.

    Article  Google Scholar 

  • Chen, P., Hansen, P., Jaumard, B., & Tuy, H. (1992). Weber’s problem with attraction and repulsion. Journal of Regional Science, 32, 467–486.

    Article  Google Scholar 

  • Church, R. L., & Garfinkel, R. S. (1978). Locating an obnoxious facility on a network. Transportation Science, 12, 107–118.

    Article  Google Scholar 

  • Church, R. L., & ReVelle, C. S. (1974). The maximal covering location problem. Papers of the Regional Science Association, 32, 101–118.

    Article  Google Scholar 

  • Cooper, L. (1963). Location-allocation problems. Operations Research, 11, 331–343.

    Article  Google Scholar 

  • Cooper, L. (1964). Heuristic methods for location-allocation problems. SIAM Review, 6, 37–53.

    Article  Google Scholar 

  • Daskin, M. S. (1995). Network and discrete location: Models, algorithms, and applications. New York: Wiley.

    Book  Google Scholar 

  • Demjanov, V. F. (1968). Algorithms for some minimax problems. Journal of Computer and System Sciences, 2, 342–380.

    Article  Google Scholar 

  • Drezner, T., & Drezner, Z. (1996). Competitive facilities: Market share and location with random utility. Journal of Regional Science, 36, 1–15.

    Article  Google Scholar 

  • Drezner, T., & Drezner, Z. (2007). Equity models in planar location. Computational Management Science, 4, 1–16.

    Article  Google Scholar 

  • Drezner, T., & Drezner, Z. (2011). A note on equity across groups in facility location. Naval Research Logistics, 58, 705–711.

    Google Scholar 

  • Drezner, T., & Drezner, Z. (2014). The maximin gradual cover location problem. OR Spectrum, 36, 903–921.

    Article  Google Scholar 

  • Drezner, T., & Drezner, Z. (2018). Asymmetric distance location model (in review).

    Google Scholar 

  • Drezner, T., & Drezner, Z. (2019). Extensions to the directional approach to gradual cover (in review).

    Google Scholar 

  • Drezner, T., Drezner, Z., & Scott, C. H. (2009a). Location of a facility minimizing nuisance to or from a planar network. Computers & Operations Research, 36, 135–148.

    Article  Google Scholar 

  • Drezner, T., Drezner, Z., & Schöbel, A. (2018). The Weber obnoxious facility location model: A Big Arc Small Arc approach. Computers and Operations Research, 98, 240–250.

    Article  Google Scholar 

  • Drezner, T., Drezner, Z., & Goldstein, Z. (2010). A stochastic gradual cover location problem. Naval Research Logistics, 57, 367–372.

    Google Scholar 

  • Drezner, T., Drezner, Z., & Kalczynski, P. (2019a). A directional approach to gradual cover. TOP, 27, 70–93.

    Article  Google Scholar 

  • Drezner, T., Drezner, Z., & Kalczynski, P. (2019b). The planar multifacility collection depots location problem. Computers and Operations Research, 102, 121–129.

    Article  Google Scholar 

  • Drezner, Z. (1981a). On a modified one-center model. Management Science, 27, 848–851.

    Article  Google Scholar 

  • Drezner, Z. (1981b). On location dominance on spherical surfaces. Operations Research, 29, 1218–1219.

    Article  Google Scholar 

  • Drezner, Z. (1985). A solution to the Weber location problem on the sphere. Journal of the Operational Research Society, 36, 333–334.

    Article  Google Scholar 

  • Drezner, Z. (1987). On the rectangular p-center problem. Naval Research Logistics Quarterly, 34, 229–234.

    Article  Google Scholar 

  • Drezner, Z. (2007). A general global optimization approach for solving location problems in the plane. Journal of Global Optimization, 37, 305–319.

    Article  Google Scholar 

  • Drezner, Z. (2009). On the convergence of the generalized Weiszfeld algorithm. Annals of Operations Research, 167, 327–336.

    Article  Google Scholar 

  • Drezner, Z. (2011). Continuous center problems. In H. A. Eiselt & V. Marianov (Eds.), Foundations of location analysis (pp. 63–78). Berlin: Springer.

    Chapter  Google Scholar 

  • Drezner, Z. (2015). The fortified Weiszfeld algorithm for solving the Weber problem. IMA Journal of Management Mathematics, 26, 1–9.

    Article  Google Scholar 

  • Drezner, Z., & Brimberg, J. (2014). Fitting concentric circles to measurements. Mathematical Methods of Operations Research, 79, 119–133.

    Article  Google Scholar 

  • Drezner, Z., Brimberg, J., Mladenovic, N., & Salhi, S. (2016a). New local searches for solving the multi-source Weber problem. Annals of Operations Research, 246, 181–203.

    Article  Google Scholar 

  • Drezner, Z., Drezner, T., & Wesolowsky, G. O. (2009b). Location with acceleration-deceleration distance. European Journal of Operational Research, 198, 157–164.

    Article  Google Scholar 

  • Drezner, Z., Klamroth, K., Schöbel, A., & Wesolowsky, G. O. (2002a). The Weber problem. In Z. Drezner & H. W. Hamacher (Eds.), Facility location: Applications and theory (pp. 1–36). Berlin: Springer.

    Chapter  Google Scholar 

  • Drezner, Z., Marianov, V., & Wesolowsky, G. O. (2016b). Maximizing the minimum cover probability by emergency facilities. Annals of Operations Research, 246, 349–362.

    Article  Google Scholar 

  • Drezner, Z., Mehrez, A., & Wesolowsky, G. O. (1991). The facility location problem with limited distances. Transportation Science, 25, 183–187.

    Article  Google Scholar 

  • Drezner, Z., & Salhi, S. (2002). Using hybrid metaheuristics for the one-way and two-way network design problem. Naval Research Logistics, 49, 449–463.

    Article  Google Scholar 

  • Drezner, Z., & Simchi-Levi, D. (1992). Asymptotic behavior of the Weber location problem on the plane. Annals of Operations Research, 40, 163–172.

    Article  Google Scholar 

  • Drezner, Z., Steiner, G., & Wesolowsky, G. O. (1985). One-facility location with rectilinear tour distances. Naval Research Logistics Quarterly, 32, 391–405.

    Article  Google Scholar 

  • Drezner, Z., Steiner, S., & Wesolowsky, G. O. (2002b). On the circle closest to a set of points. Computers & Operations Research, 29, 637–650.

    Article  Google Scholar 

  • Drezner, Z., & Suzuki, A. (2004). The big triangle small triangle method for the solution of non-convex facility location problems. Operations Research, 52, 128–135.

    Article  Google Scholar 

  • Drezner, Z., Szendrovits, A. Z., & Wesolowsky, G. O. (1984). Multi-stage production with variable lot sizes and transportation of partial lots. European Journal of Operational Research, 17, 227–237.

    Article  Google Scholar 

  • Drezner, Z., Thisse, J.-F., & Wesolowsky, G. O. (1986). The minimax-min location problem. Journal of Regional Science, 26, 87–101.

    Article  Google Scholar 

  • Drezner, Z., & Wesolowsky, G. O. (1978a). Facility location on a sphere. Journal of the Operational Research Society, 29, 997–1004.

    Article  Google Scholar 

  • Drezner, Z., & Wesolowsky, G. O. (1978b). A new method for the multifacility minimax location problem. Journal of the Operational Research Society, 29, 1095–1101.

    Article  Google Scholar 

  • Drezner, Z., & Wesolowsky, G. O. (1978c). A note on optimal facility location with respect to several regions. Journal of Regional Science, 18, 303.

    Article  Google Scholar 

  • Drezner, Z., & Wesolowsky, G. O. (1978d). A trajectory method for the optimization of the multifacility location problem with lp distances. Management Science, 24, 1507–1514.

    Article  Google Scholar 

  • Drezner, Z., & Wesolowsky, G. O. (1980a). The expected value of perfect information in facility location. Operations Research, 28, 395–402.

    Article  Google Scholar 

  • Drezner, Z., & Wesolowsky, G. O. (1980b). A maximin location problem with maximum distance constraints. AIIE Transactions, 12, 249–252.

    Article  Google Scholar 

  • Drezner, Z., & Wesolowsky, G. O. (1980c). Optimal location of a facility relative to area demands. Naval Research Logistics Quarterly, 27, 199–206.

    Article  Google Scholar 

  • Drezner, Z., & Wesolowsky, G. O. (1980d). The optimal sight angle problem. AIIE Transactions, 12, 332–338.

    Article  Google Scholar 

  • Drezner, Z., & Wesolowsky, G. O. (1980e). Single facility lp distance minimax location. SIAM Journal of Algebraic and Discrete Methods, 1, 315–321.

    Article  Google Scholar 

  • Drezner, Z., & Wesolowsky, G. O. (1981). Optimum location probabilities in the lp distance Weber problem. Transportation Science, 15, 85–97.

    Article  Google Scholar 

  • Drezner, Z., & Wesolowsky, G. O. (1982). A trajectory approach to the round trip location problem. Transportation Science, 16, 56–66.

    Article  Google Scholar 

  • Drezner, Z., & Wesolowsky, G. O. (1983a). The location of an obnoxious facility with rectangular distances. Journal of Regional Science, 23, 241–248.

    Article  Google Scholar 

  • Drezner, Z., & Wesolowsky, G. O. (1983b). Minimax and maximin facility location problems on a sphere. Naval Research Logistics Quarterly, 30, 305–312.

    Article  Google Scholar 

  • Drezner, Z., & Wesolowsky, G. O. (1985a). Layout of facilities with some fixed points. Computers & Operations Research, 12, 603–610.

    Article  Google Scholar 

  • Drezner, Z., & Wesolowsky, G. O. (1985b). Location of multiple obnoxious facilities. Transportation Science, 19, 193–202.

    Article  Google Scholar 

  • Drezner, Z., & Wesolowsky, G. O. (1989a). An approximation method for bivariate and multivariate normal equiprobability contours. Communications in Statistics: Theory and Methods, 18, 2331–2344.

    Article  Google Scholar 

  • Drezner, Z., & Wesolowsky, G. O. (1989b). The asymmetric distance location problem. Transportation Science, 23, 201–207.

    Article  Google Scholar 

  • Drezner, Z., & Wesolowsky, G. O. (1989c). Control limits for a drifting process with quadratic loss. International Journal of Production Research, 27, 13–20.

    Article  Google Scholar 

  • Drezner, Z. & Wesolowsky, G. O. (1989d). Location of an obnoxious route. Journal of the Operational Research Society, 40, 1011–1018.

    Article  Google Scholar 

  • Drezner, Z., & Wesolowsky, G. O. (1989e). Multi-buyer discount pricing. European Journal of Operational Research, 40, 38–42.

    Article  Google Scholar 

  • Drezner, Z., & Wesolowsky, G. O. (1989f). Optimal control of a linear trend process with quadratic loss. IIE Transactions, 21, 66–72.

    Article  Google Scholar 

  • Drezner, Z., & Wesolowsky, G. O. (1990). On the computation of the bivariate normal integral. Journal of Statistical Computation and Simulation, 35, 101–107.

    Article  Google Scholar 

  • Drezner, Z., & Wesolowsky, G. O. (1991a). Design of multiple criteria sampling plans and charts. International Journal of Production Research, 29, 155–163.

    Article  Google Scholar 

  • Drezner, Z., & Wesolowsky, G. O. (1991b). Facility location when demand is time dependent. Naval Research Logistics, 38, 763–777.

    Article  Google Scholar 

  • Drezner, Z., & Wesolowsky, G. O. (1991c). Optimizing control limits under random process shifts and a quadratic penalty function. Communications in Statistics: Stochastic Methods, 7, 363–377.

    Google Scholar 

  • Drezner, Z., & Wesolowsky, G. O. (1991d). The Weber problem on the plane with some negative weights. Information Systems and Operational Research, 29, 87–99.

    Article  Google Scholar 

  • Drezner, Z., & Wesolowsky, G. O. (1993). Finding the circle or rectangle containing the minimum weight of points. Studies in Locational Analysis, 4, 105–109.

    Google Scholar 

  • Drezner, Z., & Wesolowsky, G. O. (1994). Finding the circle or rectangle containing the minimum weight of points. Location Science, 2, 83–90.

    Google Scholar 

  • Drezner, Z., & Wesolowsky, G. O. (1995a). Location on a one-way rectilinear grid. Journal of the Operational Research Society, 46, 735–746.

    Article  Google Scholar 

  • Drezner, Z., & Wesolowsky, G. O. (1995b). Multivariate screening procedures for quality cost minimization. IIE Transactions, 27, 300–304.

    Article  Google Scholar 

  • Drezner, Z., & Wesolowsky, G. O. (1996a). Location-allocation on a line with demand-dependent costs. European Journal of Operational Research, 90, 444–450.

    Article  Google Scholar 

  • Drezner, Z., & Wesolowsky, G. O. (1996b). Obnoxious facility location in the interior of a planar network. Journal of Regional Science, 35, 675–688.

    Article  Google Scholar 

  • Drezner, Z., & Wesolowsky, G. O. (1996c). Review of location-allocation models with demand-dependent costs. Studies in Locational Analysis, 10, 13–24.

    Google Scholar 

  • Drezner, Z., & Wesolowsky, G. O. (1997). On the best location of signal detectors. IIE Transactions, 29, 1007–1015.

    Google Scholar 

  • Drezner, Z., & Wesolowsky, G. O. (1998). Optimal axis orientation for rectilinear minisum and minimax location. IIE Transactions, 30, 981–986.

    Google Scholar 

  • Drezner, Z., & Wesolowsky, G. O. (1999a). Allocation of demand when cost is demand-dependent. Computers & Operations Research, 26, 1–15.

    Article  Google Scholar 

  • Drezner, Z., & Wesolowsky, G. O. (1999b). Allocation of discrete demand with changing costs. Computers & Operations Research, 26, 1335–1349.

    Article  Google Scholar 

  • Drezner, Z., & Wesolowsky, G. O. (2000). Location problems with groups of demand points. Information Systems and Operational Research, 38, 359–372.

    Article  Google Scholar 

  • Drezner, Z., & Wesolowsky, G. O. (2001). On the collection depots location problem. European Journal of Operational Research, 130, 510–518.

    Article  Google Scholar 

  • Drezner, Z., & Wesolowsky, G. O. (2003). Network design: Selection and design of links and facility location. Transportation Research Part A, 37, 241–256.

    Google Scholar 

  • Drezner, Z., & Wesolowsky, G. O. (2005). Maximizing cover probability by using multivariate normal distributions. OR Spectrum, 27, 95–106.

    Article  Google Scholar 

  • Drezner, Z., & Wesolowsky, G. O. (2014). Covering part of a planar network. Networks and Spatial Economics, 14, 629–646.

    Article  Google Scholar 

  • Drezner, Z., Wesolowsky, G. O., & Drezner, T. (1998). On the Logit approach to competitive facility location. Journal of Regional Science, 38, 313–327.

    Article  Google Scholar 

  • Drezner, Z., Wesolowsky, G. O., & Drezner, T. (2004). The gradual covering problem. Naval Research Logistics, 51, 841–855.

    Article  Google Scholar 

  • Drezner, Z., Wesolowsky, G. O., & Wiesner, W. (1999). A computational procedure for setting cutoff scores for multiple tests. The Journal of Business and Management, 6, 86–98.

    Google Scholar 

  • Eiselt, H. A., & Laporte, G. (1995). Objectives in location problems. In Z. Drezner (Ed.), Facility location: A survey of applications and methods (pp. 151–180). New York, NY: Springer.

    Chapter  Google Scholar 

  • Eiselt, H. A., & Marianov, V. (2009). Gradual location set covering with service quality. Socio-Economic Planning Sciences, 43, 121–130.

    Article  Google Scholar 

  • Elzinga, J., & Hearn, D. (1972). Geometrical solutions for some minimax location problems. Transportation Science, 6, 379–394.

    Article  Google Scholar 

  • Farahani, R., Drezner, Z., & Asgari, N. (2009). Single facility location and relocation problem with time dependent weights and discrete planning horizon. Annals of Operations Research, 167, 353–368.

    Article  Google Scholar 

  • García, S., & Marín, A. (2015). Covering location problems. In G. Laporte, S. Nickel, & F. S. da Gama (Eds.), Location science (pp. 93–114). Heidelberg: Springer.

    Google Scholar 

  • Glover, F., & Laguna, M. (1997). Tabu search. Boston: Kluwer Academic Publishers.

    Book  Google Scholar 

  • Goldberg, D. E. (2006). Genetic algorithms. Delhi: Pearson Education.

    Google Scholar 

  • Hansen, P., Jaumard, B., & Krau, S. (1995). An algorithm for Weber’s problem on the sphere. Location Science, 3, 217–237.

    Article  Google Scholar 

  • Hansen, P., Peeters, D., & Thisse, J.-F. (1981). On the location of an obnoxious facility. Sistemi Urbani, 3, 299–317.

    Google Scholar 

  • Karatas, M. (2017). A multi-objective facility location problem in the presence of variable gradual coverage performance and cooperative cover. European Journal of Operational Research, 262, 1040–1051.

    Article  Google Scholar 

  • Kirkpatrick, S., Gelat, C. D., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220, 671–680.

    Article  Google Scholar 

  • Kuhn, H. W. (1967). On a pair of dual nonlinear programs. In J. Abadie (Ed.), Nonlinear programming (pp. 38–45). Amsterdam: North-Holland.

    Google Scholar 

  • Kutta, W. (1901). Beitrag zur näherungweisen integration totaler differentialgleichungen. Zeitschrift für Angewandte Mathematik und Physik, 46, 435–453.

    Google Scholar 

  • Lee, D.-T., & Schachter, B. J. (1980). Two algorithms for constructing a Delaunay triangulation. International Journal of Computer & Information Sciences, 9, 219–242.

    Article  Google Scholar 

  • Leonardi, G., & Tadei, R. (1984). Random utility demand models and service location. Regional Science and Urban Economics, 14, 399–431.

    Article  Google Scholar 

  • Love, R. F. (1972). A computational procedure for optimally locating a facility with respect to several rectangular regions. Journal of Regional Science, 12, 233–242.

    Article  Google Scholar 

  • Maranas, C. D., & Floudas, C. A. (1993). A global optimization method for Weber’s problem with attraction and repulsion. In W. W. Hager, D. W. Hearn, & P. M. Pardalos (Eds.), Large scale optimization: State of the art (pp. 259–293). Dordrecht: Kluwer.

    Google Scholar 

  • Okabe, A., Boots, B., Sugihara, K., & Chiu, S. N. (2000). Spatial tessellations: Concepts and applications of Voronoi diagrams. Wiley series in probability and statistics. Hoboken: Wiley.

    Google Scholar 

  • Plastria, F. (1991). The effects of majority in Fermat-Weber problems with attraction and repulsion. Yugoslav Journal of Operations Research, 1, 141–146.

    Google Scholar 

  • Plastria, F. (2002). Continuous covering location problems. In Z. Drezner & H. W. Hamacher (Eds.), Facility location: Applications and theory (pp. 39–83). Berlin: Springer.

    Google Scholar 

  • ReVelle, C., Toregas, C., & Falkson, L. (1976). Applications of the location set covering problem. Geographical Analysis, 8, 65–76.

    Article  Google Scholar 

  • Runge, C. (1895). Über die numerische auflösung von differentialgleichungen. Mathematische Annalen, 46, 167–178.

    Article  Google Scholar 

  • Runge, C. (1901). Über empirische funktionen und die interpolation zwischen äquidistanten ordinaten. Zeitschrift für Mathematik und Physik, 46, 224–243.

    Google Scholar 

  • Schöbel, A., & Scholz, D. (2010). The big cube small cube solution method for multidimensional facility location problems. Computers & Operations Research, 37, 115–122.

    Article  Google Scholar 

  • Shamos, M., & Hoey, D. (1975). Closest-point problems. In Proceedings 16th Annual Symposium on the Foundations of Computer Science (pp. 151–162).

    Google Scholar 

  • Snyder, L. V. (2011). Covering problems. In H. A. Eiselt & V. Marianov (Eds.), Foundations of location analysis (pp. 109–135). Berlin: Springer.

    Chapter  Google Scholar 

  • Suzuki, A., & Okabe, A. (1995). Using Voronoi diagrams. In Z. Drezner (Ed.), Facility location: A survey of applications and methods (pp. 103–118). New York: Springer.

    Chapter  Google Scholar 

  • Sylvester, J. (1857). A question in the geometry of situation. Quarterly Journal of Mathematics, 1, 79.

    Google Scholar 

  • Sylvester, J. (1860). On Poncelet’s approximate linear valuation of Surd forms. Philosophical Magazine, 20(Fourth series), 203–222.

    Google Scholar 

  • Voronoï, G. (1908). Nouvelles applications des paramètres continus à la théorie des formes quadratiques. deuxième mémoire. recherches sur les parallélloèdres primitifs. Journal für die reine und angewandte Mathematik, 134, 198–287.

    Article  Google Scholar 

  • Weber, A. (1909). Über den Standort der Industrien, 1. Teil: Reine Theorie des Standortes. English Translation: On the Location of Industries. Chicago, IL: University of Chicago Press. Translation published in 1929.

    Google Scholar 

  • Weiszfeld, E. (1936). Sur le point pour lequel la somme des distances de n points donnes est minimum. Tohoku Mathematical Journal, 43, 355–386.

    Google Scholar 

  • Wesolowsky, G. O. (1993). The Weber problem: History and perspectives. Location Science, 1, 5–23.

    Google Scholar 

  • Wesolowsky, G. O., & Love, R. F. (1971). Location of facilities with rectangular distances among point and area destinations. Naval Research Logistics Quarterly, 18, 83–90.

    Article  Google Scholar 

  • Zangwill, W. I. (1969). Nonlinear programming: A unified approach. Englewood Cliffs, NJ: Prentice-Hall.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DeGroote School of Business, McMaster University, Hamilton, ON, Canada

    George O. Wesolowsky

Authors
  1. George O. Wesolowsky
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to George O. Wesolowsky .

Editor information

Editors and Affiliations

  1. Faculty of Management, University of New Brunswick, Fredericton, NB, Canada

    H. A. Eiselt

  2. Department of Electrical Engineering, Pontificia Universidad Católica de Chile Complex Engineering Systems Institute, Santiago, Chile

    Vladimir Marianov

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Wesolowsky, G.O. (2019). Continuous Location Problems. In: Eiselt, H., Marianov, V. (eds) Contributions to Location Analysis. International Series in Operations Research & Management Science, vol 281. Springer, Cham. https://doi.org/10.1007/978-3-030-19111-5_6

Download citation

Publish with us

Policies and ethics

Search

Navigation