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

Pijls, W.H.L.M.

English

Research Papers in Economics

A Fast Algorithm for Finding Better Routes by AI Search Techniques, in:

Algorithm Design,

An A* Algorithm with a New Heuristic Distance Function for the 2-Terminal Shortest Path Problem,

and P.Norvig (2003), Arti¯cial Intelligence, A modern Approach,

and S.Pallottino

Bidirectional A*: Comparing balanced and symmetric heuristic methods, Econometric Institute

Combinatorial Optimization: Algorithms and Complexity,

Computers and intractability, A guide to the theory of NP-Completeness, Freeman,

Computing the Shortest Path: A* Search Meets Graph Theory, in:

De tijd zal het leren, inaugural address (in Dutch), in: Nieuw Archief voor Wiskunde, vijfde serie 5 nr 3,

Geometric Containers for E±cient Shortest-Path Computation, in:

Heiko Schilling, Birk Sch} utz, Dorothea Wagner and Thomas Willhalm (2005), Partitioning Graphs to Speed Up Dijkstra's Algorithm,

Heuristics, Intelligent search strategies for Computer Problem Solving,

Highway Hierarchies hasten Exact Shortest path Queries,

Network Flows, Theory, Algorithms and Applications,

On the Complexity of Admissible Search Algorithms,

Search Algorithms under Di®erent Kinds 12of Heuristics - A Comparative Study,

Shortest paths and Game trees, Ph.D.thesis,

The Power of Dominance Relations in Branch-and-Bound Algorithms,

Heuristic estimates in shortest path algorithms

Heuristic estimates in shortest path algorithms

Abstract

Similar works

Full text

Available Versions

Research Papers in Economics