Skip to main content
SpringerLink
Log in
Book cover

Combinatorial Optimization pp 593–628Cite as

Facility Location

  • Chapter
  • First Online:

Part of the book series: Algorithms and Combinatorics ((AC,volume 21))

Abstract

Many economic decisions involve selecting and/or placing certain facilities to serve given demands efficiently. Examples include manufacturing plants, storage facilities, depots, warehouses, libraries, fire stations, hospitals, base stations for wireless services (like TV broadcasting or mobile phone service), etc. The problems have in common that a set of facilities, each with a certain position, has to be chosen, and the objective is to meet the demand (of customers, users etc.) best. Facility location problems, which occur also in less obvious contexts, indeed have numerous applications.

This is a preview of subscription content, 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   69.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Cornuéjols, G., Nemhauser, G.L., and Wolsey, L.A. [1990]: The uncapacitated facility location problem. In: Discrete Location Theory (P.B. Mirchandani, R.L. Francis, eds.), Wiley, New York 1990, pp. 119–171

    Google Scholar 

  • Shmoys, D.B. [2000]: Approximation algorithms for facility location problems. Proceedings of the 3rd International Workshop on Approximation Algorithms for Combinatorial Optimization; LNCS 1913 (K. Jansen, S. Khuller, eds.), Springer, Berlin 2000, pp. 27–33

    Google Scholar 

  • Vygen, J. [2005]: Approximation algorithms for facility location problems (lecture notes). Report No. 05950-OR, Research Institute for Discrete Mathematics, University of Bonn, 2005

    Google Scholar 

  • Archer, A., Rajagopalan, R., and Shmoys, D.B. [2003]: Lagrangian relaxation for the k-median problem: new insights and continuity properties. In: Algorithms – Proceedings of the 11th European Symposium on Algorithms (ESA); LNCS 2832 (G. di Battista, U. Zwick, eds.), Springer, Berlin 2003, pp. 31–42

    Google Scholar 

  • Arora, S., Raghavan, P., and Rao, S. [1998]: Approximation schemes for Euclidean k-medians and related problems. Proceedings of the 30th Annual ACM Symposium on Theory of Computing (1998), 106–113

    Google Scholar 

  • Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., and Pandit, V. [2004]: Local search heuristics for k-median and facility location problems. SIAM Journal on Computing 33 (2004), 544–562

    Article  MATH  MathSciNet  Google Scholar 

  • Balinski, M.L. [1965]: Integer programming: methods, uses, computation. Management Science 12 (1965), 253–313

    Article  MathSciNet  Google Scholar 

  • Balinski, M.L., and Wolfe, P. [1963]: On Benders decomposition and a plant location problem. Working paper ARO-27. Mathematica, Princeton 1963

    Google Scholar 

  • Byrka, J., and Aardal, K. [2007]: The approximation gap for the metric facility location problem is not yet closed. Operations Research Letters 35 (2007), 379–384

    Article  MATH  MathSciNet  Google Scholar 

  • Byrka, J., and Aardal, K. [2010]: An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. SIAM Journal on Computing 39 (2010), 2212–2231

    Article  MATH  MathSciNet  Google Scholar 

  • Charikar, M., and Guha, S. [2005]: Improved combinatorial algorithms for the facility location and k-median problems. SIAM Journal on Computing 34 (2005), 803–824

    Article  MATH  MathSciNet  Google Scholar 

  • Charikar, M., Guha, S., Tardos, É., and Shmoys, D.B. [2002]: A constant-factor approximation algorithm for the k-median problem. Journal of Computer and System Sciences 65 (2002), 129–149

    Article  MATH  MathSciNet  Google Scholar 

  • Chudak, F.A., and Shmoys, D.B. [2003]: Improved approximation algorithms for the uncapacitated facility location problem. SIAM Journal on Computing 33 (2003), 1–25

    Article  MATH  MathSciNet  Google Scholar 

  • Feige, U. [1998]: A threshold of lnn for the approximating set cover. Journal of the ACM 45 (1998), 634–652

    Article  MATH  MathSciNet  Google Scholar 

  • Guha, S., and Khuller, S. [1999]: Greedy strikes back: improved facility location algorithms. Journal of Algorithms 31 (1999), 228–248

    Article  MATH  MathSciNet  Google Scholar 

  • Hochbaum, D.S. [1982]: Heuristics for the fixed cost median problem. Mathematical Programming 22 (1982), 148–162

    Article  MATH  MathSciNet  Google Scholar 

  • Jain, K., Mahdian, M., Markakis, E., Saberi, A., and Vazirani, V.V. [2003]: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. Journal of the ACM 50 (2003), 795–824

    Article  MathSciNet  Google Scholar 

  • Jain, K., and Vazirani, V.V. [2001]: Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation. Journal of the ACM 48 (2001), 274–296

    Article  MATH  MathSciNet  Google Scholar 

  • Kolliopoulos, S.G., and Rao, S. [2007]: A nearly linear-time approximation scheme for the Euclidean k-median problem. SIAM Journal on Computing 37 (2007), 757–782

    Article  MATH  MathSciNet  Google Scholar 

  • Korupolu, M., Plaxton, C., and Rajaraman, R. [2000]: Analysis of a local search heuristic for facility location problems. Journal of Algorithms 37 (2000), 146–188

    Article  MATH  MathSciNet  Google Scholar 

  • Kuehn, A.A., and Hamburger, M.J. [1963]: A heuristic program for locating warehouses. Management Science 9 (1963), 643–666

    Article  Google Scholar 

  • Levi, R., Shmoys, D.B., and Swamy, C. [2004]: LP-based approximation algorithms for capacitated facility location. In: Integer Programming and Combinatorial Optimization; Proceedings of the 10th International IPCO Conference; LNCS 3064 (G. Nemhauser, D. Bienstock, eds.), Springer, Berlin 2004, pp. 206–218. Mathematical Programming A, to appear

    Google Scholar 

  • Li, S. [2011]: A 1.488-approximation algorithm for the uncapacitated facility location problem. In: Automata, Languages and Programming; Proceedings of the 38th ICALP conference, Part II; LNCS 6756 (Aceto, L., Henzinger, M., Sgall, J., eds.), Springer, Berlin 2011, pp. 77–88

    Google Scholar 

  • Mahdian, M., and Pál, M. [2003]: Universal facility location. In: Algorithms – Proceedings of the 11th European Symposium on Algorithms (ESA); LNCS 2832 (G. di Battista, U. Zwick, eds.), Springer, Berlin 2003, pp. 409–421

    Google Scholar 

  • Mahdian, M., Ye, Y., and Zhang, J. [2006]: Approximation algorithms for metric facility location problems. SIAM Journal on Computing 36 (2006), 411–432

    Article  MATH  MathSciNet  Google Scholar 

  • Manne, A.S. [1964]: Plant location under economies-of-scale-decentralization and computation. Management Science 11 (1964), 213–235

    Article  Google Scholar 

  • Pál, M., Tardos, É., and Wexler, T. [2001]: Facility location with nonuniform hard capacities. Proceedings of the 42nd Annual IEEE Symposium on the Foundations of Computer Science (2001), 329–338

    Google Scholar 

  • Shmoys, D.B., Tardos, É., and Aardal, K. [1997]: Approximation algorithms for facility location problems. Proceedings of the 29th Annual ACM Symposium on Theory of Computing (1997), 265–274

    Google Scholar 

  • Stollsteimer, J.F. [1963]: A working model for plant numbers and locations. Journal of Farm Economics 45 (1963), 631–645

    Article  Google Scholar 

  • Sviridenko, M. [2002]: An improved approximation algorithm for the metric uncapacitated facility location problem. In: Integer Programming and Combinatorial Optimization; Proceedings of the 9th International IPCO Conference; LNCS 2337 (W. Cook, A. Schulz, eds.), Springer, Berlin 2002, pp. 240–257

    Google Scholar 

  • Vygen, J. [2007]: From stars to comets: improved local search for universal facility location. Operations Research Letters 35 (2007), 427–433

    Article  MATH  MathSciNet  Google Scholar 

  • Zhang, J., Chen, B., and Ye, Y. [2005]: A multi-exchange local search algorithm for the capacitated facility location problem. Mathematics of Operations Research 30 (2005), 389–403

    Article  MATH  MathSciNet  Google Scholar 

  • Zhang, P. [2007]: A new approximation algorithm for the k-facility location problem. Theoretical Computer Science 384 (2007), 126–135

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Institute for Discrete Mathematics, University of Bonn, Lennéstr. 2, 53113, Bonn, Germany

    Bernhard Korte & Jens Vygen

Authors
  1. Bernhard Korte
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jens Vygen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bernhard Korte .

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Korte, B., Vygen, J. (2012). Facility Location. In: Combinatorial Optimization. Algorithms and Combinatorics, vol 21. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24488-9_22

Download citation

Publish with us

Policies and ethics

Search

Navigation