Skip to main content
SpringerLink
Log in

A primal-dual approximation algorithm for stochastic facility location problem with service installation costs

  • Research Article
  • Published:
Frontiers of Mathematics in China Aims and scope Submit manuscript

Abstract

We consider the stochastic version of the facility location problem with service installation costs. Using the primal-dual technique, we obtain a 7-approximation algorithm.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ageev A, Ye Y, Zhang J. Improved combinatorial approximation algorithms for the k-level facility location problem. SIAM J Discrete Math, 2004, 18: 207–217

    Article  MathSciNet  MATH  Google Scholar 

  2. Byrka J, Aardal K I. An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. SIAM J Comput, 2010, 39: 2212–2213

    Article  MathSciNet  MATH  Google Scholar 

  3. Chen X, Chen B. Approximation algorithms for soft-capacitated facility location in capacitated network design. Algorithmica, 2009, 53: 263–297

    Article  MathSciNet  MATH  Google Scholar 

  4. Du D, Lu R, Xu D. A primal-dual approximation algorithm for the facility location problem with submodular penalties. Algorithmica, DOI: 10.1007/s00453-011-9526-1

  5. Du D, Wang X, Xu D. An approximation algorithm for the k-level capacitated facility location problem. J Comb Optim, 2010, 20: 361–368

    Article  MathSciNet  MATH  Google Scholar 

  6. Guha S, Khuller S. Greedy strike back: improved facility location algorithms. J Algorithms, 1999, 31: 228–248

    Article  MathSciNet  MATH  Google Scholar 

  7. Jain K, Mahdian M, Markakis E, Saberi A, Vazirani V V. Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. J ACM, 2003, 50: 795–824

    Article  MathSciNet  Google Scholar 

  8. Jain K, Vazirani V V. Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation. J ACM, 2001, 48: 274–296

    Article  MathSciNet  MATH  Google Scholar 

  9. Li S. A 1.488-approximation algorithm for the uncapacitated facility location problem. In: Proceedings of ICALP. 2011, Part II: 77–88

  10. Mahdian M, Ye Y, Zhang J. Approximation algorithms for metric facility location problems. SIAM J Comput, 2006, 36: 411–432

    Article  MathSciNet  MATH  Google Scholar 

  11. Ravi R, Sinha A. Hedging uncertainty: approximation algorithms for stochastic optimization programs. Math Program, 2006, 108: 97–114

    Article  MathSciNet  MATH  Google Scholar 

  12. Shmoys D B, Swamy C, Levi R. Facility location with service installation costs. In: Proceedings of SODA. 2004, 1081–1090

  13. Shmoys D B, Tardös E, Aardal K I. Approximation algorithms for facility location problems (extended abstract). In: Proceedings of STOC. 1997, 265–274

  14. Shu J. An efficient greedy heuristic for warehouse-retailer network design optimization. Transport Sci, 2010, 44: 183–192

    Article  Google Scholar 

  15. Shu J, Teo C P, Shen Z J Max. Stochastic transportation-inventory network design problem. Oper Res, 2005, 53: 48–60

    Article  MathSciNet  MATH  Google Scholar 

  16. Wang Z, Du D, Gabor A F, Xu D. An approximation algorithm for solving the k-level stochastic facility location problem. Oper Res Lett, 2010, 38: 386–389

    Article  MathSciNet  MATH  Google Scholar 

  17. Wang Z, Du D, Xu D. A primal-dual approximation algorithm for the k-level stochastic facility location problem. In: Proceedings of AAIM. 2010, 253–260

  18. Xu D, Zhang S. Approximation algorithm for facility location problems with service installation costs. Oper Res Lett, 2008, 36: 46–50

    Article  MathSciNet  MATH  Google Scholar 

  19. Ye Y, Zhang J. An approximation algorithm for the dynamic facility location problem. In: Combinatorial Optimization in Communication Networks. Dordrecht: Kluwer Academic Publishers, 2005, 623–637

    Google Scholar 

  20. Zhang J. Approximating the two-level facility location problem via a quasi-greedy approach. Math Program, 2006, 108: 159–176

    Article  MathSciNet  MATH  Google Scholar 

  21. Zhang J, Chen B, Ye Y. A multiexchange local search algorithm for the capacitated facility location problem. Math Oper Res, 2005, 30: 389–403

    Article  MathSciNet  MATH  Google Scholar 

  22. Zhang P. A new approximation algorithm for the k-facility location problem. Theor Comput Sci, 2007, 384: 126–135

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, School of Science, Tianjin University, Tianjin, 300072, China

    Xing Wang

  2. Department of Applied Mathematics, Beijing University of Technology, Beijing, 100124, China

    Dachuan Xu & Xinyuan Zhao

Authors
  1. Xing Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dachuan Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xinyuan Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dachuan Xu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, X., Xu, D. & Zhao, X. A primal-dual approximation algorithm for stochastic facility location problem with service installation costs. Front. Math. China 6, 957–964 (2011). https://doi.org/10.1007/s11464-011-0153-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11464-011-0153-6

Keywords

MSC

Search

Navigation