Sherali-Adams gaps, flow-cover inequalities and generalized configurations for capacity-constrained Facility Location
Stavros G. Kolliopoulos, Yannis Moysoglou

TL;DR
This paper demonstrates the limitations of linear programming relaxations for capacity-constrained facility location problems, showing unbounded gaps even at high levels of the Sherali-Adams hierarchy and with added inequalities, and introduces a new class of relaxations.
Contribution
It proves unbounded integrality gaps for Sherali-Adams relaxations and flow-cover inequalities in capacity-constrained facility location, and introduces proper relaxations with a threshold behavior.
Findings
Sherali-Adams relaxations have unbounded gaps at 3 levels.
Flow-cover inequalities do not close the gap for CFL.
Proper relaxations exhibit a sharp threshold phenomenon.
Abstract
Metric facility location is a well-studied problem for which linear programming methods have been used with great success in deriving approximation algorithms. The capacity-constrained generalizations, such as capacitated facility location (CFL) and lower-bounded facility location (LBFL), have proved notorious as far as LP-based approximation is concerned: while there are local-search-based constant-factor approximations, there is no known linear relaxation with constant integrality gap. According to Williamson and Shmoys devising a relaxation-based approximation for \cfl\ is among the top 10 open problems in approximation algorithms. This paper advances significantly the state-of-the-art on the effectiveness of linear programming for capacity-constrained facility location through a host of impossibility results for both CFL and LBFL. We show that the relaxations obtained from the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · Optimization and Search Problems · Facility Location and Emergency Management
