Heuristic estimates in shortest path algorithms
Shortest path problems occupy an important position in Operations Research as well as in Arti¯cial Intelligence. In this paper we study shortest path algorithms that exploit heuristic estimates. The well-known algorithms are put into one framework. Besides we present an interesting application of binary numbers in the shortest path theory.
|Keywords||graph theory, network flows, operations research, search problems|
Pijls, W.H.L.M.. (2006). Heuristic estimates in shortest path algorithms (No. EI 2006-40). Report / Econometric Institute, Erasmus University Rotterdam. Retrieved from http://hdl.handle.net/1765/8034