1. R.K. Ahuja, T.L. Magnanti, J.B. Orlin, Network Flows, Prentice Hall, Englewood Cliffs, NJ, 1993
2. Dual algorithms for pure network problems;Ali;Operations Research,1989
3. Relaxation methods for minimum cost ordinary and generalised network flow problems;Bertsekas;Operations Research,1988
4. J.B. Orlin, Genuinely polynomial simplex and non-simplex algorithms for minimum cost problems, Technical Report 1615-84, Sloan School of Management, MIT, Cambridge, MA, 1984
5. S. Plotkin, E. Tardos, Improved dual network simplex, in: Proceedings of the First ACMN-SIAM Symposium on Discrete Algorithms, 1990, pp. 367–376