Mobile facility location: combinatorial filtering via weighted occupancy
From MaRDI portal
Publication:2251136
DOI10.1007/s10878-012-9558-8zbMath1302.90230OpenAlexW2075262317MaRDI QIDQ2251136
Amitai Armon, Danny Segev, Iftah Gamzu
Publication date: 11 July 2014
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-012-9558-8
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (3)
Two Paths Location of a Tree with Positive or Negative Weights ⋮ Two paths location of a tree with positive or negative weights ⋮ The capacitated mobile facility location problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A dual version of Tardos's algorithm for linear programming
- A constant-factor approximation algorithm for the \(k\)-median problem
- Pipage rounding: a new method of constructing algorithms with proven performance guarantee
- A new approximation algorithm for the \(k\)-facility location problem
- Hedging uncertainty: approximation algorithms for stochastic optimization problems
- Approximation algorithms for covering/packing integer programs
- Algorithmic construction of sets for k -restrictions
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- O(1)-Approximations for Maximum Movement Problems
- Minimizing movement in mobile facility location problems
- 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
- Minimizing Movement: Fixed-Parameter Tractability
- Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints
- A constant factor approximation algorithm for the fault-tolerant facility location problem
- Local Search Heuristics for k-Median and Facility Location Problems
- Tail bounds for occupancy and the satisfiability threshold conjecture
- Fast Approximation Algorithms for Fractional Packing and Covering Problems
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Improved Combinatorial Algorithms for Facility Location Problems
- Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
- On Min-Max r-Gatherings
- A simple efficient approximation scheme for the restricted shortest path problem
This page was built for publication: Mobile facility location: combinatorial filtering via weighted occupancy