Approximating Shortest Paths in Large-Scale Networks with an Application to Intelligent Transportation Systems
From MaRDI portal
Publication:4427339
DOI10.1287/ijoc.10.2.163zbMath1034.90502OpenAlexW1997413504MaRDI QIDQ4427339
Yu-Li Chou, Robert L. Smith, H. Edwin Romeijn
Publication date: 1998
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.10.2.163
Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)
Related Items (5)
Value-at-Risk model for hazardous material transportation ⋮ Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks ⋮ Finding rectilinear least cost paths in the presence of convex polygonal congested regions ⋮ Optimal routing of vehicles with communication capabilities in disasters ⋮ Heuristic shortest path algorithms for transportation applications: state of the art
This page was built for publication: Approximating Shortest Paths in Large-Scale Networks with an Application to Intelligent Transportation Systems
