References
- Busacker , R.G. and Gowen , P.J. 1961 . A Procedure for Determining a Family of Minimal-Cost Network Flow Patterns , Baltimore : John Hopkins Univ . 0R0 Techn. Report 15, Operations Res. Office
- Forb , L.R. and Fulkerson , D.R. 1962 . Flows in Networks , russ.: Moskau (1966)
- Klein , M. 1967 . A primal method for minimal cost flows . Management Sci , 14 : 205 – 220 .
- Hu , T.C. 1961 . Revised matrix algorithms for shortest paths . SIAM J. Appl. Math , 15 : 129 – 132 .
- Narahari Pandit , N.S. 1961 . The shortest route problem . An addendum, Operations Res , 9 : 207 – 218 .
- Floyd , R.W. 1962 . Shortest Path. Armour Research Foundation.Chic. `Wabshall, S.`: A theorem on Boolean matrices . J., ACM , 9 : 11 – 12 .
- Sachs , H. 1972 . Einf. in die Theorie der endlichen Graphen , Tenbner Veriag . Teil I u. II
- Müller , A. 1983 . Eine Strategic zur Entwicklung effektiver Naherungsalgorithmen zu NP-sehweren Problemen , TH Ilmenau . Dissertation A