Respecting lower bounds in uniform lower and upper bounded facility location problem
From MaRDI portal
Cites work
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- A 3-approximation algorithm for the facility location problem with uniform capacities
- A 5-approximation for capacitated facility location
- A constant-factor approximation algorithm for the \(k\)-median problem (extended abstract)
- A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
- A new approximation algorithm for the k-facility location problem
- Algorithms - ESA 2003
- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
- Analysis of a Local Search Heuristic for Facility Location Problems
- Approximating connected facility location with lower and upper bounds via LP rounding
- Approximation algorithms for hard capacitated \(k\)-facility location problems
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Approximation algorithms for the lower-bounded \(k\)-median and its generalizations
- Bi-factor approximation algorithms for hard capacitated k-median problems
- Capacitated center problems with two-sided bounds and outliers
- Constant factor approximation algorithm for uniform hard capacitated knapsack median problem
- Greedy Strikes Back: Improved Facility Location Algorithms
- scientific article; zbMATH DE number 5764864 (Why is no real title available?)
- scientific article; zbMATH DE number 1187151 (Why is no real title available?)
- scientific article; zbMATH DE number 1342123 (Why is no real title available?)
- scientific article; zbMATH DE number 1947060 (Why is no real title available?)
- scientific article; zbMATH DE number 1559542 (Why is no real title available?)
- scientific article; zbMATH DE number 2086926 (Why is no real title available?)
- scientific article; zbMATH DE number 1833407 (Why is no real title available?)
- Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
- Improved approximation guarantees for lower-bounded facility location
- Improved Combinatorial Algorithms for Facility Location Problems
- Local Search Heuristics for k-Median and Facility Location Problems
- LP-based algorithms for capacitated facility location
- LP-based approximation algorithms for capacitated facility location
- LP-based approximation for uniform capacitated facility location problem
- On facility location with general lower bounds
- On the integrality gap of MFN relaxation for the capacitated facility location problem
- Privacy preserving clustering with constraints
- Respecting lower bounds in uniform lower and upper bounded facility location problem
- Solving Linear Programs in the Current Matrix Multiplication Time
- Solving the minimum flow problem with interval bounds and flows
- The matroid median problem
This page was built for publication: Respecting lower bounds in uniform lower and upper bounded facility location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6835787)
