Heuristic estimates in shortest path algorithms

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.

MoreLess

Year of publication:	2006-09-16
Authors:	Pijls, Pijls, W.H.L.M.
Institutions:	Faculteit der Economische Wetenschappen, Erasmus Universiteit Rotterdam
Subject:	graph theory \| network flows \| operations research \| search problems

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	application/pdf
Series:	Econometric Institute Research Papers. - ISSN 1566-7294.
Type of publication:	Book / Working Paper
Notes:	The text is part of a series RePEc:ems:eureir Number EI 2006-40
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10010731678