An LP-rounding based algorithm for a capacitated uniform facility location problem with penalties
From MaRDI portal
Publication:2045029
DOI10.1007/S10878-021-00726-0zbMath1473.90143OpenAlexW3143387519MaRDI QIDQ2045029
Publication date: 11 August 2021
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-021-00726-0
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A 3-approximation algorithm for the facility location problem with uniform capacities
- LP-based approximation algorithms for capacitated facility location
- Improved approximation algorithms for the facility location problems with linear/submodular penalties
- An improved approximation algorithm for uncapacitated facility location problem with penalties
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- Improved local search for universal facility location
- LP-Based Algorithms for Capacitated Facility Location
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Heuristics for the fixed cost median problem
- Greedy Strikes Back: Improved Facility Location Algorithms
- Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
- Analysis of a Local Search Heuristic for Facility Location Problems
- Local Search Heuristics for k-Median and Facility Location Problems
- A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
This page was built for publication: An LP-rounding based algorithm for a capacitated uniform facility location problem with penalties
