1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows, Prentice Hall, Englewood Cliffs, New Jersey (1993).
2. J. B. Orlin, “A faster strongly polynomial minimum cost flow algorithm,” in: Proc. 20th ACM STOC, 377–387 (1988).
3. G. M. Adelson-Vel’skii, E. A. Dinits, and A. V. Karzanov, Flow Algorithms [in Russian], Nauka, Moscow (1975).
4. E. G. Golshtein and D. B. Yudin, Linear Programming Problems of the Transport Type [in Russian], Nauka, Moscow (1969).
5. E. A. Dinits and A. V. Karzanov, “On the exponential complexity of algorithms of solving the general and transport problems of linear programming,” in: Sb. tr. Instituta problem upravleniya, Moscow,4, 32–41 (1974).