An approximation algorithm for the k-level concentrator location problem

DOI10.1016/J.ORL.2011.06.008zbMATH Open1235.90076OpenAlexW1483608516MaRDI QIDQ408401FDOQ408401

Authors: 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

Recommendations

• scientific article; zbMATH DE number 2038706
• Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
• An approximation algorithm for the \(k\)-level capacitated facility location problem
• Improved LP-rounding approximation algorithm for \(k\)-level uncapacitated facility location
• An approximation algorithm for the \(k\)-level stochastic facility location problem

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)

Cites Work

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

Cited In (2)

• Multi-level facility location problems
• Efficient algorithms for the capacitated concentrator location problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q408401)