Pages that link to "Item:Q2968155"
From MaRDI portal
The following pages link to LP-Based Algorithms for Capacitated Facility Location (Q2968155):
Displaying 37 items.
- Integrality gaps for strengthened linear relaxations of capacitated facility location (Q304227) (← links)
- Local search algorithm for universal facility location problem with linear penalties (Q506471) (← links)
- Approximation algorithms for the transportation problem with market choice and related models (Q1785305) (← links)
- Easy capacitated facility location problems, with connections to lot-sizing (Q1984675) (← links)
- Heuristics for the dynamic facility location problem with modular capacities (Q2029361) (← links)
- An LP-rounding based algorithm for a capacitated uniform facility location problem with penalties (Q2045029) (← links)
- An approximation algorithm for stochastic multi-level facility location problem with soft capacities (Q2082185) (← links)
- A technique for obtaining true approximations for \(k\)-center with covering constraints (Q2118113) (← links)
- Bifactor approximation for location routing with vehicle and facility capacities (Q2171591) (← links)
- LP-based approximation for uniform capacitated facility location problem (Q2172086) (← links)
- A note on LP-based approximation algorithms for capacitated facility location problem (Q2172603) (← links)
- Capacitated covering problems in geometric spaces (Q2189730) (← links)
- \(\mathrm{M}^p\)UFLP: universal facility location problem in the \(p\)-th power of metric space (Q2197535) (← links)
- Iterative partial rounding for vertex cover with hard capacities (Q2223692) (← links)
- Approximation algorithm for squared metric facility location problem with nonuniform capacities (Q2422751) (← links)
- On inequalities with bounded coefficients and pitch for the min knapsack polytope (Q2673233) (← links)
- An Approximation Algorithm for Uniform Capacitated k-Median Problem with $$1+\epsilon $$ Capacity Violation (Q3186508) (← links)
- A $$(5.83+\epsilon )$$ ( 5.83 + ϵ ) -Approximation Algorithm for Universal Facility Location Problem with Linear Penalties (Q3467835) (← links)
- (Q4612478) (← links)
- Recent Developments in Approximation Algorithms for Facility Location and Clustering Problems (Q4689624) (← links)
- Generalized Center Problems with Outliers (Q4972687) (← links)
- (Q5009578) (← links)
- A Technique for Obtaining True Approximations for k-Center with Covering Constraints (Q5041734) (← links)
- A Water-Filling Primal-Dual Algorithm for Approximating NonLinear Covering Problems (Q5058125) (← links)
- Capacitated Covering Problems in Geometric Spaces (Q5115774) (← links)
- Tight approximation for partial vertex cover with hard capacities (Q5136285) (← links)
- (Q5874473) (← links)
- (Q5874534) (← links)
- On the cost of essentially fair clusterings (Q5875470) (← links)
- Robust \(k\)-center with two types of radii (Q5918429) (← links)
- Robust \(k\)-center with two types of radii (Q5925649) (← links)
- (Q6065419) (← links)
- Improved bounds for metric capacitated covering problems (Q6107884) (← links)
- Constant-factor approximation algorithms for parity-constrained facility location and \(k\)-center (Q6107886) (← links)
- Approximation algorithms for the fault-tolerant facility location problem with submodular penalties (Q6117321) (← links)
- The facility location problem with maximum distance constraint (Q6121428) (← links)
- Capacitated facility location with outliers/penalties (Q6168979) (← links)