✦ LIBER ✦

SOLUTION OF THE SHORTEST ROUTE PROBLEM USING THE ASSIGNMENT TECHNIQUE

✍ Scribed by RICK HESSE

Book ID: 118714799
Publisher: Decision Sciences Institute, Georgia State University
Year: 1972
Tongue: English
Weight: 391 KB
Volume: 3
Category: Article
ISSN: 0011-7315
DOI: 10.1111/j.1540-5915.1972.tb00522.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Convergence of successive approximations

Convergence of successive approximations in the shortest route problem

✍ Donald L Bentley; Kenneth L Cooke 📂 Article 📅 1965 🏛 Elsevier Science 🌐 English ⚖ 248 KB

Dynamic algorithms for the shortest path

Dynamic algorithms for the shortest path routing problem: learning automata-based solutions

✍ Misra, S.; Oommen, B.J. 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 622 KB

Implementation and efficiency of Moore-a

Implementation and efficiency of Moore-algorithms for the shortest route problem

✍ U. Pape 📂 Article 📅 1974 🏛 Springer-Verlag 🌐 English ⚖ 347 KB

Stability of user-equilibrium route flow

Stability of user-equilibrium route flow solutions for the traffic assignment problem

✍ Shu Lu; Yu (Marco) Nie 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 232 KB

A Proof of the Hirsch Conjecture on the

A Proof of the Hirsch Conjecture on the Polyhedron of the Shortest Route Problem

✍ Saigal, Romesh 📂 Article 📅 1969 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 647 KB