On a routing problem

作者：Richard Bellman · 发表于：Quarterly of Applied Mathematics · 年份：1958 · DOI：10.1090/qam/102435 · 被引用次数：2760 · 研究领域：Advanced Bandit Algorithms Research、Optimization and Search Problems、Machine Learning and Algorithms

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.