✦ LIBER ✦

The Shortest-Route Problem

✍ Scribed by Robert M. Peart, Paul H. Randolph and T. E. Bartlett

Book ID: 123684377
Publisher: INFORMS
Year: 1960
Tongue: English
Weight: 160 KB
Volume: 8
Category: Article
ISSN: 0030-364X
DOI: 10.2307/167237

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Stochastic Shortest Route Problem

✍ C. Elliott Sigal, A. Alan B. Pritsker and James J. Solberg 📂 Article 📅 1980 🏛 INFORMS 🌐 English ⚖ 909 KB

The shortest route problem with constrai

The shortest route problem with constraints

✍ H.C Joksch 📂 Article 📅 1966 🏛 Elsevier Science 🌐 English ⚖ 294 KB

The Shortest-Route Problem-An Addendum

✍ S. N. Narahari Pandit 📂 Article 📅 1961 🏛 INFORMS 🌐 English ⚖ 169 KB

A Constrained Shortest Route Problem

✍ Romesh Saigal 📂 Article 📅 1968 🏛 INFORMS 🌐 English ⚖ 271 KB

The shortest and the K-shortest routes a

The shortest and the K-shortest routes as assignment problems

✍ A. Weintraub 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 552 KB

## Abstract The problem of finding a shortest route in a network with unrestricted costs is approached through solving an assignment problem associated to the network. The upper bound on the number of elementary calculations required for the solution is 0(m^3^). However, in most cases, the actual

A Variant on the Shortest-Route Problem

✍ George J. Minty 📂 Article 📅 1958 🏛 INFORMS 🌐 English ⚖ 120 KB