A new bidirectional search algorithm with shortened postprocessing

DOI10.1016/j.ejor.2008.09.032zbMath1163.90530OpenAlexW1979850869MaRDI QIDQ1026755

Wim Pijls, Henk Post

Publication date: 29 June 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2008.09.032

zbMATH Keywords

shortest pathbidirectional searchroad network search

Mathematics Subject Classification ID

Search theory (90B40)

Related Items (2)

MM: a bidirectional search algorithm that is guaranteed to meet in the middle ⋮ Note on ``A new bidirectional algorithm for shortest paths

Uses Software

• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• \(BS^*:\) An admissible bidirectional staged heuristic search algorithm
• On the complexity of admissible search algorithms
• Heuristic shortest path algorithms for transportation applications: state of the art
• On a routing problem
• The shortest path problem on large-scale real-road networks
• Bidirectional Heuristic Search Again
• Heuristic estimates in shortest path algorithms
• Algorithms – ESA 2005
• Finding the Shortest Route between Two Points in a Network
• An Appraisal of Some Shortest-Path Algorithms
• Experimental and Efficient Algorithms

This page was built for publication: A new bidirectional search algorithm with shortened postprocessing