Acceleration of the A*-Algorithm for the Shortest Path Problem in Digital Road Maps

DOI10.1007/978-3-540-77903-2_70zbMath1209.90302OpenAlexW1603946796MaRDI QIDQ5391964

Klaus Ambrosi, Felix Hahne, Curt Nowak

Publication date: 7 April 2011

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77903-2_70

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• On the optimality of A
• Shortest path calculation in large road networks
• Estimation and determination of shortest path length in a road network with obstacles
• The shortest path problem on large-scale real-road networks
• Heuristic estimates in shortest path algorithms
• Point-to-Point Shortest Path Algorithms with Preprocessing
• Algorithms – ESA 2005
• Algorithms - ESA 2003

This page was built for publication: Acceleration of the A*-Algorithm for the Shortest Path Problem in Digital Road Maps