References
B. N. Pshenichnyi and E. E. Kirik, “Algorithms for optimal flow distribution in networks”, Kibern. Sistem. Anal., No. 4, 29–39 (1993).
F. Harary, Graph Theory, Addison-Wesley, Reading, Mass. (1969).
L. R. Ford and D. R. Fulkerson, Flows in Networks, Princeton University Press, Princeton, N.J. (1962).
B. N. Pshenichnyi, Convex Analysis and Extremal Problems [in Russian], Nauka, Moscow (1980).
V. G. Karmanov, Mathematical Programming [in Russian], Nauka, Moscow (1975).
B. N. Pshenichnyi, “Calculating power grids by computer”, Zh. Vychisl. Matem. Mat. Fiziki,2, No. 5, 942–947 (1962).
G. E. Forsythe, M. A. Malcolm, and C. B. Moler, Computer Methods for Mathematical Computations, Prentice Hall, Englewood Cliffs, N.J. (1977).
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 67–77, November–December, 1994.
Rights and permissions
About this article
Cite this article
Pshenichnyi, B.N., Kirik, E.E. Nonlinear programming methods and network flows. Cybern Syst Anal 30, 846–854 (1994). https://doi.org/10.1007/BF02366443
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02366443