On a routing problem
Abstract: Given a set of $N$ cities, with every two linked by a road, and the times required to traverse these roads, we wish to determine the path from one given city to another given city which minimizes the travel time. The times are not directly proportional to the distances due to varying quality of roads and varying quantities of traffic.
R. Bellman, Dynamic Programming, Princeton University Press, 1957
R. Bellman, The Theory of Dynamic Programming, Bull. Amer. Math. Soc., 60, 503-515 (1954)
Retrieve articles in Quarterly of Applied Mathematics with MSC: 90.00
Retrieve articles in all journals with MSC: 90.00