An approximation algorithm for the \(k\)-level concentrator location problem

DOI10.1016/j.orl.2011.06.008zbMath1235.90076OpenAlexW1483608516MaRDI QIDQ408401

Moritz A. Drexl

Publication date: 5 April 2012

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

Full work available at URL: https://doi.org/10.1016/j.orl.2011.06.008

zbMATH Keywords

approximation algorithmmulti-level facility locationcomplementary slackness

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (1)

Multi-level facility location problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new approximation algorithm for the multilevel facility location problem
• Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems
• A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem
• Approximating the two-level facility location problem via a quasi-greedy approach
• Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem

This page was built for publication: An approximation algorithm for the \(k\)-level concentrator location problem