An approximation algorithm for the \(p\)-hub median problem

DOI10.1016/J.ENDM.2017.10.032zbMath1397.90321OpenAlexW2765725004MaRDI QIDQ2413170

André L. Vignatti, Camile Frazão Bordini

Publication date: 9 April 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.10.032

zbMATH Keywords

linear programmingapproximation algorithms\(p\)-hub median problemhub location problems

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

A parameterized approximation algorithm for the multiple allocation \(k\)-hub center

Cites Work

• Unnamed Item
• Integer programming formulations of discrete hub location problems
• Network hub location problems: The state of the art
• A new greedy approach for facility location problems
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians

This page was built for publication: An approximation algorithm for the \(p\)-hub median problem