Locating an obnoxious plane

DOI10.1016/J.EJOR.2005.02.048MaRDI QIDQ2496077zbMATH OpenOpenAlexFDO

Authors Mario A. Lopez, J. M. Díaz-Báñez, J. Antoni Sellarès

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

computational geometrydualitylocationmaximin

Mathematics Subject Classification ID

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

Recommendations

• Computational Science and Its Applications – ICCSA 2004
• The Largest Empty Annulus Problem
• THE LARGEST EMPTY ANNULUS PROBLEM
• Locating an obnoxious line among planar objects
• Locating an obnoxious line among planar objects

Cites work

• Computing a Largest Empty Anchored Cylinder, and Related Problems
• Computing circular separability
• Computing largest empty circles with location constraints
• Computing the width of a set
• Continuous location of dimensional structures.
• Geometric complexity of some location problems
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 732977 (Why is no real title available?)
• Linear Facility Location in Three Dimensions—Models and Solution Methods
• Locating lines and hyperplanes. Theory and algorithms
• Obnoxious facility location: complete service with minimal harm
• On the sum of squares of cell complexities in hyperplane arrangements
• Red-blue separability problems in 3D
• The K-dense corridor problems
• THE LARGEST EMPTY ANNULUS PROBLEM
• The overlay of lower envelopes and its applications
• The power of geometric duality revisited
• The widest k-dense corridor problems
• Topologically sweeping an arrangement
• Widest empty L-shaped corridor

Cited in

(12)

• Minmax-distance approximation and separation problems: geometrical properties
• Review of obnoxious facilities location problems
• The maximin HAZMAT routing problem
• scientific article; zbMATH DE number 4133805 (Why is no real title available?)
• scientific article; zbMATH DE number 6131442 (Why is no real title available?)
• Computational Science and Its Applications – ICCSA 2004
• Minimum-width double-slabs and widest empty slabs in high dimensions
• Maximum-width rainbow-bisecting empty annulus
• On k-enclosing slab problems
• Searching in the plane
• Minimum-width double-slabs and widest empty slabs in high dimensions
• The maximin line problem with regional demand

This page was built for publication: Locating an obnoxious plane

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