A combinatorial algorithm for the 1-median problem in \(\mathbb R^d\) with the Chebyshev norm

DOI10.1016/J.ORL.2010.07.002zbMath1202.90174OpenAlexW2167861110MaRDI QIDQ613330

Andreas Karrenbauer, Johannes Hatzl

Publication date: 20 December 2010

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

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

zbMATH Keywords

facility location1-median problemfractional \(b\)-matching

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items (2)

2-balanced flows and the inverse 1-median problem in the Chebyshev space ⋮ Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees

Cites Work

• A polynomial algorithm for b-matchings: An alternative approach
• Inverse median problems
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A combinatorial algorithm for the 1-median problem in \(\mathbb R^d\) with the Chebyshev norm