1. Ford, L.R. and Fulkerson, D.R., Flows in Networks, Princeton: Princeton Univ. Press, 1962. Translated under the title Potoki v setyakh, Moscow: Mir, 1966.
2. Ahuja, R.K., Magnati, T.L., and Orlin, J.B., Network Flows: Theory, Algorithms and Applications, New Jersey: Prentice Hall, 1993.
3. Fleischer, L. and Skutella, M., Minimum Cost Flows Over Time without Intermediate Storage, Proc. 35th ACM/SIAM Symp. Discrete Algorithms (SODA), 2003, pp. 66–75.
4. Erzin, A.I. and Takhonov, I.I., The Problem of Finding a Balanced Flow, Sib. Zh. Industr. Mat., 2006, vol. 9, no. 4 (28), pp. 50–63.
5. Feller, W., An Introduction to Probability Theory and Its Applications, New York: Wiley, 1968, vol. 1.