Finding shortest paths in the plane in the presence of barriers to travel (for any \(l_ p\)-norm)
DOI10.1016/0377-2217(85)90010-4zbMath0565.90014OpenAlexW2067366087MaRDI QIDQ1058966
Publication date: 1985
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(85)90010-4
combinatorial analysislocationplanar networkpolygonal barriersshortest paths between given sets of points
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Inventory, storage, reservoirs (90B05)
Related Items (8)
Cites Work
- Unnamed Item
- A note on two problems in connexion with graphs
- Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle
- A Note on Algebras
- An Algorithm for a Constrained Weber Problem
- Facility Locations with the Manhattan Metric in the Presence of Barriers to Travel
- Finding minimum rectilinear distance paths in the presence of barriers
- Solutions of Constrained Location Problems
This page was built for publication: Finding shortest paths in the plane in the presence of barriers to travel (for any \(l_ p\)-norm)