Research work · 1958
On a routing problem
Richard Bellman
Quarterly of Applied Mathematics
Abstract
Given a set of N 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.
DOI: 10.1090/qam/102435