Advertisement

Facility Location

  • Vijay V. Vazirani

Abstract

The facility location problem has occupied a central place in operations research since the early 1960’s. It models design situations such as deciding placements of factories, warehouses, schools, and hospitals. Modern day applications include placement of proxy servers on the web.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Notes

  1. 131.
    D. S. Hochbaum. Heuristics for the fixed cost median problem. Mathematical Programming, 22: 148–162, 1982.MathSciNetCrossRefGoogle Scholar
  2. 247.
    D.B. Shmoys, E. Tardos, and K.I. Aardal. Approximation algorithms for facility location problems. In Proc. 29th ACM Symposium on the Theory of Computing, pages 265–274, 1997.Google Scholar
  3. 148.
    K. Jain and V.V. Vazirani. Approximation algorithms for the metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation. Journal of the ACM, 48: 274–296, 2001.MathSciNetCrossRefGoogle Scholar
  4. 209.
    M. Mandian, Y. Ye, and J. Zhang. Improved approximation algorithms for metric facility location problems. In Proc. 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, volume 2462 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2002.Google Scholar
  5. 124.
    S. Guha and S. Khuller. Greedy strikes back: Improved facility location algorithms. Journal of Algorithms, 31: 228–248, 1999.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Vijay V. Vazirani
    • 1
  1. 1.Georgia Institute of TechnologyCollege of ComputingAtlantaUSA

Personalised recommendations