1. Ahuja, R.K., Goldberg, A.V., Orlin, J.B., Tarjan, R.E.: Finding Minimum-Cost Flows by Double Scaling. Math. Prog. 53, 243–266 (1992)
2. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows. In: Nemhauser, G.L., Rinnooy Kan, A.H.G., Todd, M.J. (eds.) Optimization. Handbooks in operations research and management science, vol. 1, pp. 211–369. North-Holland, Amsterdam (1989)
3. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall (1993)
4. Bertsekas, D.P.: Distributed asynchronous relaxation methods for linear network flow problems. Technical Report LIDS-p-1986, Lab. for decision systems M.I.T. (1986)
5. Bland, R.G., Jensen, D.L.: On the computational behavior of a polynomial-time network flow algorithm. Math. Prog. 54, 1–41 (1992)