IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v41y2021i4d10.1007_s10878-021-00726-0.html
   My bibliography  Save this article

An LP-rounding based algorithm for a capacitated uniform facility location problem with penalties

Author

Listed:
  • Wei Lv

    (Tianjin Renai College)

  • Chenchen Wu

    (Tianjin University of Technology)

Abstract

Facility location problem is a well established research area within Operations Research. Capacitated facility location problem is one of the most important variants, in which each facility has an upper bound on the demand, i.e., capacity. Moreover, the integrality gap of the natural linear program relaxation for the problem is infinite. Fortunately, the gap is finite when all opening costs for the facilities are the same. We consider a capacity facility location problem with penalties in which it is allowed some customers are not served by facilities and all opening costs are uniform. Based on LP-rounding framework, we propose a 5.732-approximation algorithm.

Suggested Citation

  • Wei Lv & Chenchen Wu, 2021. "An LP-rounding based algorithm for a capacitated uniform facility location problem with penalties," Journal of Combinatorial Optimization, Springer, vol. 41(4), pages 888-904, May.
    • Handle: RePEc:spr:jcomop:v:41:y:2021:i:4:d:10.1007_s10878-021-00726-0
    DOI: 10.1007/s10878-021-00726-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-021-00726-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-021-00726-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Jiawei Zhang & Bo Chen & Yinyu Ye, 2005. "A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem," Mathematics of Operations Research, INFORMS, vol. 30(2), pages 389-403, May.
    2. Eric Angel & Nguyen Kim Thang & Damien Regnault, 2015. "Improved local search for universal facility location," Journal of Combinatorial Optimization, Springer, vol. 29(1), pages 237-246, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yicheng Xu & Dachuan Xu & Donglei Du & Chenchen Wu, 2017. "Local search algorithm for universal facility location problem with linear penalties," Journal of Global Optimization, Springer, vol. 67(1), pages 367-378, January.
    2. Aardal, Karen & van den Berg, Pieter L. & Gijswijt, Dion & Li, Shanfei, 2015. "Approximation algorithms for hard capacitated k-facility location problems," European Journal of Operational Research, Elsevier, vol. 242(2), pages 358-368.
    3. Dongmei Zhang & Dachuan Xu & Yishui Wang & Peng Zhang & Zhenning Zhang, 2018. "A local search approximation algorithm for a squared metric k-facility location problem," Journal of Combinatorial Optimization, Springer, vol. 35(4), pages 1168-1184, May.
    4. Lu Han & Dachuan Xu & Donglei Du & Dongmei Zhang, 0. "An approximation algorithm for the uniform capacitated k-means problem," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-12.
    5. Eric Angel & Nguyen Kim Thang & Damien Regnault, 2015. "Improved local search for universal facility location," Journal of Combinatorial Optimization, Springer, vol. 29(1), pages 237-246, January.
    6. Fengmin Wang & Dachuan Xu & Chenchen Wu, 2016. "Combinatorial approximation algorithms for the robust facility location problem with penalties," Journal of Global Optimization, Springer, vol. 64(3), pages 483-496, March.
    7. Lu Han & Dachuan Xu & Donglei Du & Dongmei Zhang, 2022. "An approximation algorithm for the uniform capacitated k-means problem," Journal of Combinatorial Optimization, Springer, vol. 44(3), pages 1812-1823, October.
    8. Shuxin Cai & Wenguo Yang & Yaohua Tang, 2014. "Approximating soft-capacitated facility location problem with uncertainty," Journal of Combinatorial Optimization, Springer, vol. 28(2), pages 496-504, August.
    9. Jein-Shan Chen & Shaohua Pan & Chun-Hsu Ko, 2011. "A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation," Journal of Global Optimization, Springer, vol. 50(4), pages 713-728, August.
    10. Yanjun Jiang & Dachuan Xu & Donglei Du & Chenchen Wu & Dongmei Zhang, 2018. "An approximation algorithm for soft capacitated k-facility location problem," Journal of Combinatorial Optimization, Springer, vol. 35(2), pages 493-511, February.
    11. Lu Han & Dachuan Xu & Donglei Du & Dongmei Zhang, 2018. "A local search approximation algorithm for the uniform capacitated k-facility location problem," Journal of Combinatorial Optimization, Springer, vol. 35(2), pages 409-423, February.
    12. Ioannis Avgerinos & Ioannis Mourtos & Georgios Zois, 2022. "Multi-type facility location in printing and parcel delivery services," Annals of Operations Research, Springer, vol. 309(1), pages 365-393, February.
    13. Donglei Du & Xing Wang & Dachuan Xu, 2010. "An approximation algorithm for the k-level capacitated facility location problem," Journal of Combinatorial Optimization, Springer, vol. 20(4), pages 361-368, November.
    14. Silva, Allyson & Aloise, Daniel & Coelho, Leandro C. & Rocha, Caroline, 2021. "Heuristics for the dynamic facility location problem with modular capacities," European Journal of Operational Research, Elsevier, vol. 290(2), pages 435-452.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:41:y:2021:i:4:d:10.1007_s10878-021-00726-0. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.