Heuristic estimates in shortest path algorithms |
| |
| Authors: | Wim Pijls |
| |
| Institution: | Econometric Institute, Erasmus University Rotterdam, P.O. Box 1738, 3000 DR Rotterdam, The Netherlands |
| |
| Abstract: | Shortest path problems occupy an important position in operations research as well as in artificial 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: | network flows graph theory operations research search problems |
|
|
