On a Routing Problem¶
Authors: Richard Bellman
Published: 1958 (Journal Paper)
Source: Quarterly of Applied Mathematics
Algorithm: Bellman-Ford
DOI: 10.1090/qam/102435
Summary¶
Introduces the Bellman-Ford shortest-path algorithm using dynamic programming, handling graphs with negative-weight edges and detecting negative cycles. Foundational to modern network routing and graph search.
Abstract¶
This paper is devoted to the discussion of the determination of an optimal path between two cities in a network of roads where the travel time depends upon the road and possibly the time of departure and the direction of travel.
Links¶
Primary
Standard
Tags¶
-
Shortest path
-
Graph search
-
Dynamic programming
-
Bellman-Ford algorithm
-
Network routing