Facility Location with Matroid or Knapsack Constraints
From MaRDI portal
Publication:5252229
DOI10.1287/moor.2014.0678zbMath1328.68303OpenAlexW2167389897MaRDI QIDQ5252229
Ravishankar Krishnaswamy, Barna Saha, Yogish Sabharwal, Viswanath Nagarajan, Amit Kumar
Publication date: 29 May 2015
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/fbc8e9f52d58aea722317a4834435603270e8103
Combinatorial optimization (90C27) Discrete location and assignment (90B80) Combinatorial aspects of matroids and geometric lattices (05B35) Approximation algorithms (68W25)
Related Items (6)
On some variants of Euclidean \(k\)-supplier ⋮ The distance-constrained matroid median problem ⋮ The Euclidean k-Supplier Problem ⋮ Unnamed Item ⋮ Representative families for matroid intersections, with applications to location, packing, and covering problems ⋮ Locating Depots for Capacitated Vehicle Routing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Local search algorithms for the red-blue median problem
- A factor 2 approximation algorithm for the generalized Steiner network problem
- Testing membership in matroid polyhedra
- Approximation algorithms for geometric median problems
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- A constant-factor approximation algorithm for the \(k\)-median problem
- A Dependent LP-Rounding Approach for the k-Median Problem
- Randomized Competitive Algorithms for Generalized Caching
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- A new greedy approach for facility location problems
- Local Search Heuristics for k-Median and Facility Location Problems
- Improved Combinatorial Algorithms for Facility Location Problems
- Approximating k-median via pseudo-approximation
This page was built for publication: Facility Location with Matroid or Knapsack Constraints
