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.90014MaRDI QIDQ1058966

Pierre Hansen, José Viegas

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

zbMATH Keywords

combinatorial analysis; location; planar network; polygonal barriers; shortest paths between given sets of points

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

68Q25: Analysis of algorithms and problem complexity

05C35: Extremal problems in graph theory

65K05: Numerical mathematical programming methods

90B05: Inventory, storage, reservoirs

Related Items

A reduction result for location problems with polyhedral barriers, Was Euclid an unnecessarily sophisticated psychologist?, An efficient algorithm for facility location in the presence of forbidden regions, Some personal views on the current state and the future of locational analysis, Rectilinear distance to a facility in the presence of a square barrier, A multifacility location problem on median spaces, Facility location problems in the presence of single convex/non-convex polygonal barrier/forbidden region.

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