Easy capacitated facility location problems, with connections to lot-sizing
From MaRDI portal
Publication:1984675
DOI10.1016/j.orl.2019.12.006OpenAlexW2996940612WikidataQ126405019 ScholiaQ126405019MaRDI QIDQ1984675
David P. Williamson, Alice Paul
Publication date: 7 April 2020
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.02727
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A 3-approximation algorithm for the facility location problem with uniform capacities
- Primal-dual schema for capacitated covering problems
- Multi-item lot-sizing with joint set-up costs
- Greedy algorithms for the single-demand facility location problem
- Perspectives of Monge properties in optimization
- A 5-Approximation for Capacitated Facility Location
- LP-Based Algorithms for Capacitated Facility Location
- A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
- A threshold of ln n for approximating set cover
- Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities
- Two-query PCP with subconstant error
- Deterministic Production Planning: Algorithms and Complexity
- Heuristics for the fixed cost median problem
- Computational Complexity of the Capacitated Lot Size Problem
- Greedy Strikes Back: Improved Facility Location Algorithms
- On the hardness of approximating minimization problems
- Analysis of a Local Search Heuristic for Facility Location Problems
- Constant Approximation Algorithm for Non-Uniform Capacitated Multi-Item Lot-Sizing via Strong Covering Inequalities
- Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
- Efficient probabilistically checkable proofs and applications to approximations
- Analytical approach to parallel repetition
- Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems
