April 1, 1958Open Access

On a routing problem

Key Points

Key points are not available for this paper at this time.

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.

Connected Papers

Building similarity graph...

Analyzing shared references across papers

Discussion

Cite this study

Richard Bellman (Tue,) studied this question.

www.synapsesocial.com/papers/6a01cac90ed7d2e5335c9a72 — DOI: https://doi.org/10.1090/qam/102435

Also consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

On a Quasi-Linear Equation· 1956 · 22 citations
The theory of dynamic programming· 1954 · 1,427 citations
Dynamic Programming· 1966 · 13,085 citations
Decision making in the face of uncertainty ‐ II· 1954 · 5 citations
A Mathematical Treatment of Learning Models· 1952 · 3 citations

On a routing problem

Key Points

Abstract

Citation Network

Connected Papers

Discussion

Cite this study

Also consider

Authors

Journals

Actions

References and Citations

Citation Network

Connected Papers

Discussion