1. Ahuja, R., Magnanti, T., Orlin, J.B.: Network Flows. Prentice Hall, New York (1993)
2. Akgul, M.: Shortest paths and the simplex method. Technical Report, Department of Computer Sciences and Operations Research Program, North Carolina State University, Raleigh, NC (1986)
3. Bellman, R.: On a route problem. Q. Appl. Math. 16, 87–90 (1958)
4. Cherkassky, B.V., Goldberg, A.V., Radzik, T.: Shortest paths algorithms: theory and experimental evaluation. Math. Program. 73, 129–174 (1996)
5. Cunningham, W.H.: Theoretical properties of the network simplex method. Math. Program. 4, 196–208 (1979)