Dijkstra's algorithm on-line

DOI10.1145/351827.384254MaRDI QIDQ5463409zbMATH OpenOpenAlexFDO

Authors Frank Schulz, Dorothea Wagner, 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

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

Recommendations

• Speed-Up Techniques for Shortest-Path Computations
• A memetic algorithm to schedule planned maintenance for the national grid
• Classical and contemporary shortest path problems in road networks: Implementation and experimental analysis of the TRANSIMS router
• Faster algorithms for the shortest path problem
• Algorithm engineering for route planning: an update

Cited in

(14)

• Temporal network optimization subject to connectivity constraints
• Least expected time paths in stochastic schedule-based transit networks
• Energy-optimal routes for battery electric vehicles
• On the cardinality of the Pareto set in bicriteria shortest path problems
• A recommender system for train routing: when concatenating two minimum length paths is not the minimum length path
• User-constrained multimodal route planning
• How to find good night train connections
• Speed-Up Techniques for Shortest-Path Computations
• The Shortcut Problem – Complexity and Approximation
• Engineering Route Planning Algorithms
• Graph bisection with Pareto optimization
• Connection Scan Algorithm
• Customizable contraction hierarchies
• A novel pseudo‐polynomial approach for shortest path problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5463409)