A comment on a minmax location problem

DOI10.1016/S0167-6377(98)00033-9zbMath0957.90083OpenAlexW2036339863MaRDI QIDQ1306472

Gerhard J. Woeginger

Publication date: 4 October 1999

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

Full work available at URL: https://doi.org/10.1016/s0167-6377(98)00033-9

zbMATH Keywords

location theorycenter problemsrestricted location problems

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items (3)

The 1-Center and 1-Highway Problem ⋮ The 1-\textsc{Center} and 1-\textsc{Highway} problem revisited ⋮ Complexity results on planar multifacility location problems with forbidden regions

Cites Work

• Unnamed Item
• A variant of Ben-Or's lower bound for algebraic decision trees
• Geometric complexity of some location problems
• A note on center problems with forbidden polyhedra
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains

This page was built for publication: A comment on a minmax location problem