Heuristic estimates in shortest path algorithms

Shortest path problems occupy an important position in Operations Research aswell as in Arti¯cial Intelligence. In this paper we study shortest path algorithms thatexploit heuristic estimates. The well-known algorithms are put into one framework.Besides we present an interesting application of binary numbers in the shortest paththeory.operations research;graph theory;network flows;search problems