Computing obnoxious 1-corner polygonal chains

DOI10.1016/J.COR.2004.09.006MaRDI QIDQ2571197zbMATH OpenOpenAlexFDO

Authors J. M. Díaz-Báñez, Ferran Hurtado

Publication date 1 November 2005

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2004.09.006

zbMATH Keywords

computational geometrymaximinfacility locationtransportation

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Recommendations

• Computing an obnoxious anchored segment.
• scientific article; zbMATH DE number 2086226
• scientific article; zbMATH DE number 2111731
• Approximation of point sets by 1-corner polygonal chains
• scientific article; zbMATH DE number 4100913

Cites work

• scientific article; zbMATH DE number 732977 (Why is no real title available?)
• Approximation of point sets by 1-corner polygonal chains
• COMPUTING A DOUBLE-RAY CENTER FOR A PLANAR POINT SET
• Computational Science and Its Applications – ICCSA 2004
• Computing a Largest Empty Anchored Cylinder, and Related Problems
• Computing an obnoxious anchored segment.
• Computing largest empty circles with location constraints
• Continuous location of dimensional structures.
• Improved algorithms for placing undesirable facilities
• Location of an Obnoxious Route
• Modeling of transport risk for hazardous materials
• Obnoxious facility location: complete service with minimal harm
• Semi-obnoxious single facility location in Euclidean space.
• THE LARGEST EMPTY ANNULUS PROBLEM
• Widest empty L-shaped corridor

Cited in

(9)

• Improved Algorithm for a Widest 1-Corner Corridor
• THE ANCHORED VORONOI DIAGRAM: STATIC, DYNAMIC VERSIONS AND APPLICATIONS
• On finding a widest empty 1-corner corridor
• Improved algorithm for the widest empty 1-corner corridor
• The maximin HAZMAT routing problem
• The maximin line problem with regional demand
• Approximation of point sets by 1-corner polygonal chains
• Computing an obnoxious anchored segment.
• On finding widest empty curved corridors

This page was built for publication: Computing obnoxious 1-corner polygonal chains

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