A comment on a minmax location problem

DOI10.1016/S0167-6377(98)00033-9MaRDI QIDQ1306472zbMATH OpenOpenAlexFDO

Authors 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

center problemslocation theoryrestricted location problems

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Recommendations

• An O\((n \log{}n)\) algorithm for a maxmin location problem
• scientific article; zbMATH DE number 4204110
• A minimax planar location problem with forbidden zones: its solution algorithm
• scientific article; zbMATH DE number 4181131

Cites work

• A note on center problems with forbidden polyhedra
• A variant of Ben-Or's lower bound for algebraic decision trees
• Geometric complexity of some location problems
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
• Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains

Cited in

(9)

• An O\((n \log{}n)\) algorithm for a maxmin location problem
• A note on center problems with forbidden polyhedra
• Complexity results on planar multifacility location problems with forbidden regions
• General models in min-max planar location: Checking optimality conditions
• The Minisum and Minimax Location Problems Revisited
• MINIMAX LOCATION PROBLEM WITH A-DISTANCE
• scientific article; zbMATH DE number 4003525 (Why is no real title available?)
• The 1-center and 1-highway problem
• The 1-\textsc{Center} and 1-\textsc{Highway} problem revisited

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

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