Finding rectilinear least cost paths in the presence of convex polygonal congested regions

DOI10.1016/j.cor.2007.10.023zbMath1179.90258OpenAlexW1982620848MaRDI QIDQ955608

Rajan Batta, Avijit Sarkar, Rakesh Nagi

Publication date: 20 November 2008

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

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

zbMATH Keywords

congested regionsleast cost pathrectilinear distance metric

Mathematics Subject Classification ID

Convex programming (90C25) Continuous location (90B85)

Related Items (2)

The Weber problem in congested regions with entry and exit points ⋮ Generalization of the restricted planar location problems: unified metaheuristic algorithms

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• Proximity problems for points on a rectilinear plane with rectangular obstacles
• Mixed planar/network facility location problems
• \(L_ 1\) shortest paths among polygonal obstacles in the plane
• Rectilinear paths among rectilinear obstacles
• Shortest Path Algorithms: An Evaluation Using Real Road Networks
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• Facility Locations with the Manhattan Metric in the Presence of Barriers to Travel
• Finding minimum rectilinear distance paths in the presence of barriers
• The weighted region problem
• Approximating Shortest Paths in Large-Scale Networks with an Application to Intelligent Transportation Systems
• Rectilinear Path Problems among Rectilinear Obstacles Revisited
• AN OPTIMAL DATA STRUCTURE FOR SHORTEST RECTILINEAR PATH QUERIES IN A SIMPLE RECTILINEAR POLYGON

This page was built for publication: Finding rectilinear least cost paths in the presence of convex polygonal congested regions