Two new bidirectional search algorithms

DOI10.1007/s10589-021-00303-5zbMath1478.90136OpenAlexW3186910487MaRDI QIDQ2231042

Edward C. Sewell, John A. Pavlik, Jacobson, Sheldon H.

Publication date: 29 September 2021

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-021-00303-5

zbMATH Keywords

heuristic searchbidirectional searchdiscrete algorithmroadpancakeconsistent heuristic

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• CUDA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
• MM: a bidirectional search algorithm that is guaranteed to meet in the middle
• Dynamically improved bounds bidirectional search
• Bidirectional Heuristic Search Again
• An Improved Bidirectional Heuristic Search Algorithm
• Finding the Shortest Route between Two Points in a Network

This page was built for publication: Two new bidirectional search algorithms