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

Wei Lv () and Chenchen Wu ()
Additional contact information
Wei Lv: Tianjin Renai College
Chenchen Wu: Tianjin University of Technology

Journal of Combinatorial Optimization, 2021, vol. 41, issue 4, No 7, 888-904

Abstract: 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.

Keywords: Capacitated facility location problem; Approximation algorithm; Linear program (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-021-00726-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:41:y:2021:i:4:d:10.1007_s10878-021-00726-0

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-021-00726-0

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().