Premium
Heuristic estimates in shortest path algorithms
Author(s) -
Pijls Wim
Publication year - 2007
Publication title -
statistica neerlandica
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.52
H-Index - 39
eISSN - 1467-9574
pISSN - 0039-0402
DOI - 10.1111/j.1467-9574.2007.00348.x
Subject(s) - shortest path problem , constrained shortest path first , k shortest path routing , yen's algorithm , shortest path faster algorithm , heuristic , path (computing) , consistent heuristic , euclidean shortest path , computer science , algorithm , position (finance) , exploit , mathematical optimization , mathematics , theoretical computer science , incremental heuristic search , artificial intelligence , dijkstra's algorithm , search algorithm , beam search , graph , finance , economics , programming language , computer security
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.