Solving Classic Discrete Facility Location Problems Using Excel Spreadsheets

Published Online:https://doi.org/10.1287/ited.2021.0245

References

  • Balinski ML (1965) Integer programming: Methods, uses, computations. Management Sci. 12(3):253–313.LinkGoogle Scholar
  • Church RL, ReVelle C (1974) The maximal covering location problem. Papers Regional Sci. Assoc. 32(1):101–118.CrossrefGoogle Scholar
  • Cornuejols G, Nemhauser GL, Wolsey LA (1990) The uncapacitated facility location problem. Francis RL, Mirchandani PB, eds. Discrete Location Theory (Wiley-Interscience, New York), 119–171.Google Scholar
  • Daskin MS (1982) Application of an expected covering model to emergency medical service system design. Decision Sci. 13(3):416–439.CrossrefGoogle Scholar
  • Daskin MS (2008) What you should know about location modeling. Naval Res. Logist. 55(4):283–294.CrossrefGoogle Scholar
  • Daskin MS (2013) Network and Discrete Location: Models, Algorithms and Applications, 2nd ed. (John Wiley & Sons, Hoboken, NJ).Google Scholar
  • Daskin MS, Stern EH (1981) A hierarchical objective set covering model for emergency medical service vehicle deployment. Transportation Sci. 15(2):137–152.LinkGoogle Scholar
  • Dekle J, Lavieri MS, Martin E, Emir-Farinas H, Francis RL (2005) A Florida county locates disaster recovery centers. Interfaces 35(2):133–139.LinkGoogle Scholar
  • Fruchterman TMJ, Reingold EM (1991) Graph drawing by force-directed placement. J. Software Practice Experience 21(11):1129–1164.CrossrefGoogle Scholar
  • Galli L, Letchford AN, Miller SJ (2018) New valid inequalities and facets for the simple plant location problem. Eur. J. Oper. Res. 269(3):824–833.CrossrefGoogle Scholar
  • Hakimi SL (1964) Optimum locations of switching centers and the absolute centers and medians of a graph. Oper. Res. 12(3):450–459.LinkGoogle Scholar
  • Hakimi SL (1965) Optimum distribution of switching centers in a communication network and some graph theoretic problems. Oper. Res. 13(3):462–475.LinkGoogle Scholar
  • Kuehn AA, Hamburger MJ (1963) A heuristic program for locating warehouses. Management Sci. 9(4):643–666.LinkGoogle Scholar
  • Lee WC, Yang NS (2009) Location problems solving by spreadsheets. WSEAS Trans. Bus. Econom. 8(6):469–480.Google Scholar
  • Mason AJ (2012) OpenSolver—An open source add-in to solve linear and integer progammes in Excel. Klatte D, Lüthi H-J, Schmedders K, eds. Oper. Res. Proc. 2011 (Springer, Berlin), 401–406.Google Scholar
  • ReVelle CS, Eiselt HA (2005) Location analysis: A synthesis and survey. Eur. J. Oper. Res. 165(1):1–19.CrossrefGoogle Scholar
  • ReVelle CS, Eiselt HA, Daskin MS (2008) A bibliography for some fundamental problem categories in discrete location science. Eur. J. Oper. Res. 184(3):817–848.CrossrefGoogle Scholar
  • Schärlig A (1973) About the confusion between the center of gravity and Weber’s optimum. Regional Urban Econom. 3(4):371–382.CrossrefGoogle Scholar
  • Stern EH (1979) Multiobjective ambulance deployment for a two-tiered EMS system. Unpublished master’s thesis, University of Texas at Austin, Austin.Google Scholar
  • Toregas C, ReVelle CS (1972) Optimal location under time or distance constraints. Papers Regional Sci. Assoc. 28(1):133–144.CrossrefGoogle Scholar
  • Toregas C, Swain R, ReVelle CS, Bergman L (1971) The location of emergency service facilities. Oper. Res. 19(6):1363–1373.LinkGoogle Scholar
  • van den Berg PL, Legemaate GAG, van der Mei RD (2017) Increasing the responsiveness of firefighter services by relocating base stations in Amsterdam. Interfaces 47(4):352–361.LinkGoogle Scholar
  • Weltman D, Tokar T (2019) Using a Monte Carlo simulation exercise to teach principles of distribution: An enhanced version of the classic transportation problem. INFORMS Trans. Ed. 19(3):111–120.LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.