Skip to main content
SpringerLink
Log in

An Approximation Algorithm for the Two-Stage Distributionally Robust Facility Location Problem

  • Conference paper
  • First Online:
Advances in Global Optimization

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 95))

Abstract

In this paper, we introduce a model of distributionally robust facility location problem (DRFLP) under moment constraints up to the second order. We show, via duality theory of moment problems, that the linear relaxation of the DRFLP is equivalent to that of the standard uncapacitated facility location problem (UFLP). Consequently, any LP-based approximation algorithm for the UFLP implies an approximation algorithm for the DRFLP with the same approximation ratio.

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

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

    Google Scholar 

  2. Li, S.: A 1. 488-approximation algorithm for the uncapacitated facility location problem. Inform. Comput. 222, 45–58 (2013)

    Google Scholar 

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

    Article  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

  8. Ravi R., Sinha, A.: Hedging uncertainty: approximation algorithms for stochastic optimization problems. Math. Program. Ser. A 108, 97–114 (2006)

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  10. Shmoys, D.B., Swamy, C.: An approximation scheme for stochastic linear programming and its application to stochastic integer programs. J. ACM 53, 978–1012 (2006)

    Article  MathSciNet  Google Scholar 

  11. Bertsimas, D., Popescu I,: Optimal inequalities in probability theory: a convex optimization approach. SIAM J. Optim. 15, 780–804 (2005)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Acknowledgements

The research of the first author is supported by NSF of China (No. 11371001). The second author’s research is supported by the Natural Sciences and Engineering Research Council of Canada (NSERC) grant 283106. The third author’s research is supported by Scientific Research Common Program of Beijing Municipal Commission of Education (No. KM201210005033) and China Scholarship Council.

Author information

Authors and Affiliations

  1. College of Science, Tianjin University of Technology, Tianjin, 300384, People’s Republic of China

    Chenchen Wu

  2. Department of Applied Mathematics, Beijing University of Technology, 100 Pingleyuan, Chaoyang District, Beijing, 100124, People’s Republic of China

    Donglei Du & Dachuan Xu

  3. Faculty of Business Administration, University of New Brunswick, Fredericton, NB, E3B 9Y2, Canada

    Donglei Du

Authors
  1. Chenchen Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Donglei Du
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dachuan Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dachuan Xu .

Editor information

Editors and Affiliations

  1. School of Science, Information Technology and Engineering, Federation University Australia, Ballarat, Victoria, Australia

    David Gao

  2. School Science, Inform., Tech. & Engg., Federation University Australia, Ballarat, Victoria, Australia

    Ning Ruan

  3. Dept. of Mathematical Sciences, Tsinghua University, Beijing, China

    Wenxun Xing

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Wu, C., Du, D., Xu, D. (2015). An Approximation Algorithm for the Two-Stage Distributionally Robust Facility Location Problem. In: Gao, D., Ruan, N., Xing, W. (eds) Advances in Global Optimization. Springer Proceedings in Mathematics & Statistics, vol 95. Springer, Cham. https://doi.org/10.1007/978-3-319-08377-3_11

Download citation

Publish with us

Policies and ethics

Search

Navigation