Heuristic estimates in shortest path algorithms

DOI10.1111/j.1467-9574.2007.00348.xzbMath1122.90101OpenAlexW2139558309MaRDI QIDQ5422014

Wim Pijls

Publication date: 26 October 2007

Published in: Statistica Neerlandica (Search for Journal in Brave)

Full work available at URL: http://repub.eur.nl/pub/66331

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Markov and semi-Markov decision processes (90C40)

Related Items

Acceleration of the A*-Algorithm for the Shortest Path Problem in Digital Road Maps ⋮ A new bidirectional search algorithm with shortened postprocessing

Cites Work

• Unnamed Item
• Unnamed Item
• On the complexity of admissible search algorithms
• The shortest path problem on large-scale real-road networks
• Shortest path methods: A unifying approach
• Search Algorithms Under Different Kinds of Heuristics—A Comparative Study
• The Power of Dominance Relations in Branch-and-Bound Algorithms

This page was built for publication: Heuristic estimates in shortest path algorithms