On a routing problem
Author:
Richard Bellman
Journal:
Quart. Appl. Math. 16 (1958), 87-90
MSC:
Primary 90.00
DOI:
https://doi.org/10.1090/qam/102435
MathSciNet review:
102435
Full-text PDF Free Access
Abstract | References | Similar Articles | Additional Information
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.
- Richard Bellman, Dynamic programming, Princeton University Press, Princeton, N. J., 1957. MR 0090477
- Richard Bellman, The theory of dynamic programming, Bull. Amer. Math. Soc. 60 (1954), 503–515. MR 67459, DOI https://doi.org/10.1090/S0002-9904-1954-09848-8
Retrieve articles in Quarterly of Applied Mathematics with MSC: 90.00
Retrieve articles in all journals with MSC: 90.00
Additional Information
Article copyright:
© Copyright 1958
American Mathematical Society
