Skip to main content
SpringerLink
Log in

Combinatorial approximation algorithms for the robust facility location problem with penalties

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

In this paper, we consider the robust facility location problem with penalties, aiming to serve only a specified fraction of the clients. We formulate this problem as an integer linear program to identify which clients must be served. Based on the corresponding LP relaxation and dual program, we propose a primal–dual (combinatorial) 3-approximation algorithm. Combining the greedy augmentation procedure, we further improve the above approximation ratio to 2.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

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. 18, 207–217 (2003)

    Article  MathSciNet  Google Scholar 

  2. Aggarwal, A., Anand, L., Bansal, M., Garg, N., Gupta, N., Gupta, S., Jain, S.: A \(3\)-approximation for facility location with uniform capacities. In: Proceedings of IPCO, pp. 149–162 (2010)

  3. Bumb, A.: An approximation algorithm for the maximization version of the two level uncapacitated facility location problem. Oper. Res. Lett. 29, 155–161 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  4. Byrka, J., Srinivasan, A., Swamy, C.: Fault-tolerant facility location: a randomized dependent LP-rounding algorithm. In: Proceedings of IPCO, pp. 244–257 (2010)

  5. Charikar, M., Guha, S.: Improved combinatorial algorithms for facility location problems. SIAM J. Comput. 34, 803–824 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  6. Charikar, M., Khuller, S., Mount, D.M., Naraasimban, G.: Algorithms for facility location problems with outliers. In: Proceedings of SODA, pp. 642–651 (2001)

  7. Chechik, S., Peleg, D.: Robust fault-tolerant facility location. In: Proceedings of STACS, pp. 191–202 (2010)

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

    Article  Google Scholar 

  9. Chudak, F.A., Shmoys, D.B.: Improved approximation algorithms for the uncapacitated facility location problem. SIAM J. Comput. 33, 1–25 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  10. Chudak, F.A., Williamson, D.P.: Improved approximation algorithms for capacitated facility location problems. Math. Program. 102, 207–222 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  11. Cornuejols, G., Nemhauser, G.L., Wolsey, L.A.: The uncapacitated facility location problem. In: Mirchandani, P.B., Francis, R.L. (eds.) Discrete Location Theory, pp. 119–171 (1990)

  12. Du, D., Lu, R., Xu, D.: A primal–dual approximation algorithm for the facility location problem with submodular penalties. Algorithmica 63, 191–200 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  13. Grandoni, F., Rothvo\(\beta \), T.: Approximation algorithm for single and connected facility location. In: Proceedings of IPCO, pp. 248–260 (2011)

  14. Guha, S., Khuller, S.: Greedy strikes back: improved facility location algorithms. J. Algorithm 31, 228–248 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  15. Hajiaghayi, M., Mahdian, M., Mirrokni, V.S.: The facility location problem with general cost functions. Networks 42, 42–47 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  16. 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. 50, 795–824 (2003)

    Article  MathSciNet  Google Scholar 

  17. 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. 48, 274–296 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  18. Jung, H., Hasan, M.K., Chwa, K.-Y.: A \(6.55\) factor primal–dual approximation algorithm for the connected facility location problem. J. Comb. Optim. 18, 258–271 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  19. Kuehn, A.A., Hamburger, M.J.: A heuristic program for locating warehouses. Manag. Sci. 9, 643–666 (1963)

    Article  Google Scholar 

  20. Levi, R., Shmoys, D.B., Swamy, C.: LP-based approximation algorithms for capacitated facility location. Math. Program. 131, 365–379 (2012)

    Article  MathSciNet  MATH  Google Scholar 

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

  22. Li, Y., Du, D., Xiu, N., Xu, D.: Improved approximation algorithms for the facility location problems with linear/submodular penalty. In: Proceedings of COCOON, pp. 292–303 (2013)

  23. Li, G., Li, Y., Shu, J., Xu, D.: A cross-monotonic cost sharing scheme for the concave facility location game. J. Global Optim. 56, 1325–1335 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  24. Li, Y., Xu, D., Du, D., Xiu, N.: Improved approximation algorithms for the robust fault-tolerant facility location problem. Inform. Process. Lett. 112, 361–364 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  25. Mahdian, M., Pál, M.: Universal facility location. In: Proceedings of ESA, pp. 409–421 (2003)

  26. Mahdian, M., Ye, Y., Zhang, J.: Improved approximation algorithms for metric facility location problems. In: Proceedings of APPROX, pp. 229–242 (2002)

  27. Mahdian, M., Ye, Y., Zhang, J.: A \(2\)-approximation algorithm for the soft-capacitated facility location problem. In: Proceedings of APPROX, pp. 129–140 (2003)

  28. Pál, M., Tardös, E., Wexler, T.: Facility location with hard capacities. In: Proceedings of FOCS, pp. 329–338 (2001)

  29. Romeijn, H.E., Sharkey, T.C., Max Shen, Z.-J., Zhang, J.: Integrating facility location and production planning decisions. Networks 55, 78–89 (2010)

    MathSciNet  MATH  Google Scholar 

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

  31. Shu, J.: An efficient greedy heuristic for warehouse-retailer network design optimization. Transp. Sci. 44, 183–192 (2010)

    Article  Google Scholar 

  32. Sviridenko, M.: An improved approximation algorithm for the metric uncapacitated facility location problem. In: Proceedings of IPCO, pp. 240–257 (2002)

  33. Vazirani, V.V.: Approximation Algorithm. Springer, New York (2001)

    Google Scholar 

  34. Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms. Cambridge University Press, Cambridge (2011)

    Book  MATH  Google Scholar 

  35. Xu, D.: A cross-monotonic cost sharing method for the facility location game with service installation costs. Sci. China Ser. A. 52, 2530–2536 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  36. Xu, D., Du, D.: The \(k\)-level facility location game. Oper. Res. Lett. 34, 421–426 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  37. Xu, G., Xu, J.: An LP rounding algorithm for approximating uncapacitated facility location problem with penalties. Inform. Process. Lett. 94, 119–123 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  38. Xu, G., Xu, J.: An improved approximation algorithm for uncapacitated facility location problem with penalties. J. Comb. Optim. 17, 424–436 (2008)

    Article  Google Scholar 

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

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  42. 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  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

The second author’s research is supported by NSF of China (No. 11371001).

Author information

Authors and Affiliations

  1. Department of Information and Operations Research, Beijing University of Technology, 100 Pingleyuan, Chaoyang District, Beijing, 100124, People’s Republic of China

    Fengmin Wang & Dachuan Xu

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

    Chenchen Wu

Authors
  1. Fengmin 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. Chenchen Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dachuan Xu.

Additional information

A preliminary version of the paper appeared in Proceedings of the 2013 World Congress on Global Optimization, Yellow Mountain, Anhui, China, 2013.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wang, F., Xu, D. & Wu, C. Combinatorial approximation algorithms for the robust facility location problem with penalties. J Glob Optim 64, 483–496 (2016). https://doi.org/10.1007/s10898-014-0251-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-014-0251-6

Keywords

Search

Navigation