A note on center problems with forbidden polyhedra

DOI10.1016/S0167-6377(97)00003-5zbMath0879.90128MaRDI QIDQ1362521

Horst W. Hamacher, Anita Schöbel

Publication date: 25 January 1998

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

zbMATH Keywords

polynomial algorithmcenter problemsmaximum Euclidean distancerestricted location

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items (5)

Dominance rules for the optimal placement of a finite-size facility in an existing layout ⋮ The Weber obnoxious facility location model: a big arc small arc approach ⋮ The obnoxious facilities planar \(p\)-median problem ⋮ Complexity results on planar multifacility location problems with forbidden regions ⋮ A comment on a minmax location problem

Cites Work

• Multicriteria planar location problems
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• A Maxmin Location Problem
• Unnamed Item

This page was built for publication: A note on center problems with forbidden polyhedra