๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The Shortest-Route Problem-An Addendum

โœ Scribed by S. N. Narahari Pandit

Book ID
123684532
Publisher
INFORMS
Year
1961
Tongue
English
Weight
169 KB
Volume
9
Category
Article
ISSN
0030-364X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The Shortest-Route Problem
The Shortest-Route Problem
โœ Robert M. Peart, Paul H. Randolph and T. E. Bartlett ๐Ÿ“‚ Article ๐Ÿ“… 1960 ๐Ÿ› INFORMS ๐ŸŒ English โš– 160 KB
The Stochastic Shortest Route Problem
The Stochastic Shortest Route Problem
โœ C. Elliott Sigal, A. Alan B. Pritsker and James J. Solberg ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› INFORMS ๐ŸŒ English โš– 909 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