Heuristic estimates in shortest path algorithms
2006-09-16
Research Paper
This publication is part of collection
| Related Files |
|---|
View PDF Version
(ei2006-40.pdf, 0.2MB) |
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
Automatically Extracted Terms
- algorithm
- estimate
- heuristic
- length
- s-set algorithm
- number
- graph
- search
- s-set
- pi +1
- iteration
- predecessor path
- value
- heuristic estimate h
- predecessor
- proof
- heuristic estimate
- path algorithms
- network
- section
