2007-02-01
Heuristic estimates in shortest path algorithms
Publication
Publication
Statistica Neerlandica , Volume 61 - Issue 1 p. 61- 74
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.
| Additional Metadata | |
|---|---|
| , , , | |
| doi.org/10.1111/j.1467-9574.2007.00348.x, hdl.handle.net/1765/66331 | |
| Statistica Neerlandica | |
| Organisation | Erasmus School of Economics |
|
Pijls, W. (2007). Heuristic estimates in shortest path algorithms. Statistica Neerlandica, 61(1), 61–74. doi:10.1111/j.1467-9574.2007.00348.x |
|
