Dijkstra's algorithm on-line

DOI10.1145/351827.384254zbMath1070.90509OpenAlexW2101923813MaRDI QIDQ5463409

Dorothea Wagner, Frank Schulz, Karsten Weihe

Publication date: 4 August 2005

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/351827.384254

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Traffic problems in operations research (90B20)

Related Items (13)

On the cardinality of the Pareto set in bicriteria shortest path problems ⋮ Graph Bisection with Pareto Optimization ⋮ A novel pseudo‐polynomial approach for shortest path problems ⋮ A recommender system for train routing: when concatenating two minimum length paths is not the minimum length path ⋮ Connection Scan Algorithm ⋮ Temporal network optimization subject to connectivity constraints ⋮ The Shortcut Problem – Complexity and Approximation ⋮ Least expected time paths in stochastic schedule-based transit networks ⋮ How to find good night train connections ⋮ Engineering Route Planning Algorithms ⋮ Energy-optimal routes for battery electric vehicles ⋮ User-Constrained Multimodal Route Planning ⋮ Customizable Contraction Hierarchies

This page was built for publication: Dijkstra's algorithm on-line