Showing 1 - 10 of 1,193
A widely known algorithm for ¯nding the shortest path in a network is Bidirectional A*. The version of bidirectional A* that is considered the most appropriate hitherto, uses so-called balanced heuristic estimates. In this paper, we focus on symmetric heuristic estimates. First, we show that...
Persistent link: https://www.econbiz.de/10010837827
A widely known algorithm for ¯nding the shortest path in a network is Bidirectional A*. The version of bidirectional A* that is considered the most appropriate hitherto, uses so-called balanced heuristic estimates. In this paper, we focus on symmetric heuristic estimates. First, we show that...
Persistent link: https://www.econbiz.de/10005450866
Persistent link: https://www.econbiz.de/10005037350
Persistent link: https://www.econbiz.de/10005037366
Persistent link: https://www.econbiz.de/10005013093
Persistent link: https://www.econbiz.de/10005056401
Persistent link: https://www.econbiz.de/10005056406
Persistent link: https://www.econbiz.de/10005056472
Persistent link: https://www.econbiz.de/10005056477
Persistent link: https://www.econbiz.de/10005037385