Improved approximation algorithms for multilevel facility location problems
From MaRDI portal
Publication:1866994
DOI10.1016/S0167-6377(02)00162-1zbMath1010.90038OpenAlexW2074682523MaRDI QIDQ1866994
Publication date: 2 April 2003
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6377(02)00162-1
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items
A new mixed integer linear programming model for the multi level uncapacitated facility location problem ⋮ A review of hierarchical facility location models ⋮ Approximation algorithms for \(k\)-level stochastic facility location problems ⋮ Solving Facility Location Problem Based on Duality Approach ⋮ An improved approximation algorithm for the \(k\)-level facility location problem with soft capacities ⋮ Approximation algorithms for the dynamic \(k\)-level facility location problems ⋮ Multi-level facility location problems ⋮ A new approximation algorithm for the multilevel facility location problem ⋮ The vendor location problem ⋮ Approximating the two-level facility location problem via a quasi-greedy approach ⋮ Unnamed Item
Cites Work
- A note on two problems in connexion with graphs
- A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem
- Cost-Distance: Two Metric Network Design
- 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
- Greedy Strikes Back: Improved Facility Location Algorithms
- Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
- Local search heuristic for k-median and facility location problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
