Improved approximation algorithms for multilevel facility location problems

DOI10.1016/S0167-6377(02)00162-1zbMath1010.90038MaRDI QIDQ1866994

A. A. Ageev

Publication date: 2 April 2003

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

approximation algorithm; facility location; performance guarantee; polynomial-time reduction

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90B80: Discrete location and assignment

Related Items

The vendor location problem, A review of hierarchical facility location models, A new approximation algorithm for the multilevel facility location problem, Approximating the two-level facility location problem via a quasi-greedy approach

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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