Locating an obnoxious plane

DOI10.1016/j.ejor.2005.02.048zbMath1110.90064OpenAlexW2095186281MaRDI QIDQ2496077

Mario A. Lopez, J. Antoni Sellarès, José-Miguel Díaz-Báñez

Publication date: 30 June 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.02.048

zbMATH Keywords

maximindualitylocationcomputational geometry

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Discrete location and assignment (90B80)

Related Items (4)

The maximin HAZMAT routing problem ⋮ The maximin line problem with regional demand ⋮ Review of obnoxious facilities location problems ⋮ Minmax-distance approximation and separation problems: geometrical properties

Cites Work

• Unnamed Item
• Unnamed Item
• Widest empty L-shaped corridor
• The power of geometric duality revisited
• Computing circular separability
• Geometric complexity of some location problems
• Topologically sweeping an arrangement
• The widest k-dense corridor problems
• Locating lines and hyperplanes. Theory and algorithms
• On the sum of squares of cell complexities in hyperplane arrangements
• Continuous location of dimensional structures.
• The overlay of lower envelopes and its applications
• OBNOXIOUS FACILITY LOCATION: COMPLETE SERVICE WITH MINIMAL HARM
• Computing largest empty circles with location constraints
• Red-Blue Separability Problems in 3D
• Linear Facility Location in Three Dimensions—Models and Solution Methods
• Computing the width of a set
• The K-dense corridor problems
• Computing a Largest Empty Anchored Cylinder, and Related Problems
• THE LARGEST EMPTY ANNULUS PROBLEM

This page was built for publication: Locating an obnoxious plane