Template-Type: ReDIF-Paper 1.0
Author-Name: Pijls, W.H.L.M.
Author-Name-Last: Pijls
Author-Name-First: Wim
Title: Heuristic estimates in shortest path algorithms
Abstract: 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.
Creation-Date: 2006-09-16
File-URL: https://repub.eur.nl/pub/8034/ei2006-40.pdf
File-Format: application/pdf
Series: RePEc:ems:eureir
Number: EI 2006-40
Keywords: graph theory, network flows, operations research, search problems
Handle: RePEc:ems:eureir:8034