A dual simplex algorithm for finding all shortest paths. (English) Zbl 0471.90085


90C35 Programming involving graphs or networks
05C35 Extremal problems in graph theory
65K05 Numerical mathematical programming methods
Full Text: DOI


[1] Linear Programming and Extensions, Princeton U. P., Princeton, New Jersey, 1963.
[2] Denardo, Oper. Res. 27 pp 161– (1979)
[3] Dial, Networks 9 pp 215– (1979)
[4] Dionne, INFOR 16 pp 132– (1978)
[5] Dreyfus, Oper. Res. 17 pp 395– (1969)
[6] Floyd, Comm. A.C.M. 5 pp 345– (1962)
[7] ”Reoptimization Procedures in Shortest Path Problems,” Publication No. 132, Centre de recherche sur les transports, Université de Montréal (1979).
[8] and , ”A Performance Comparison of Labeling Algorithms for Calculating Shortest Path Trees,” NBS Technical Note 772, U.S. Department of Commerce (1973).
[9] LeBlanc, Transp. Res. 9 pp 309– (1975)
[10] ”A Fixed Matrix Method for All Shortest Distances in a Directed Graph and for the Inverse Problem,” Ph.D. thesis, Karlsruhe University, 1970.
[11] ”A Unified Approach to Equilibrium Methods for Traffic Assignment,” Traffic Equilibrium Methods, Lecture Notes in Economics and Mathematical Systems, 118, Springer-Verlag, New York 1976, pp. 168–182.
[12] and , ”An Equilibrium Traffic Assignment Program,” Publication No. 17, Centre de recherche sur les transports, Université de Montréal, 1975.
[13] Pape, Math. Program. 7 pp 212– (1974)
[14] Yaged, Networks 3 pp 315– (1971)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.