An algorithm for finding the shortest route between two nodes in a network with unrestricted costs on the arcs is presented. The method is based on solving an equivalent assignment problem. (Author)
The Assignment and the Shortest Route Problems
1972
24 pages
Report
Keine Angabe
Englisch
Handling materials via the shortest route
Engineering Index Backfile | 1928
Shortest route algorithm with movement prohibitions
Elsevier | 1984
|Method for calculating shortest distance navigation route
Europäisches Patentamt | 2023
|Traffic assignment by shortest path method using TD factor
Engineering Index Backfile | 1967
|