Abstract
We consider the problem of finding a maximum flow in networks with strictly and nonstrictly determined flow distribution. We show that, for each condition of flow distribution, a solution to the problem under consideration exists and is unique. Some algorithms for finding a maximum flow are developed for each condition of flow distribution. We find bounds for the maximum flow value in networks with strict flow distribution.
Similar content being viewed by others
References
A. I. Erzin and I. I. Takhonov, “The Problem of Search for a Balanced Flow,” Sibirsk.Zh. Industr. Mat. 9 (4), 50–63 (2006).
Ya. M. Erusalimskii and N. N. Vodolazov, “Unsteady Flow in a Network,” Vestnik Donsk. Gos. Tekhn. Univ. 9 (3), 402–409 (2009).
Ya. M. Erusalimskii, V. A. Skorokhodov, M. V. Kuzminova, and A. G. Petrosyan, Graphs with Nonstandard Connectivity: Problems and Applications (Yuzhn. Federal. Univ., Rostov-on-Don, 2009) [in Russian].
O. P. Kuznetsov and L. Yu. Zhilyakova, “Bidirectional ResourceNetworks: ANew Flow Model,” Dokl. Akad. Nauk 433 (5), 609–612 (2010) [Dokl.Math. 82 (1), 643–646 (2010)].
A. G. Kurosh, Higher Algebra (Nauka, Moscow, 1975; Mir, Moscow, 1975).
V. A. Skorokhodov, “Flows on Graphs with Varying Transit Times Through the Arcs,” Izv. Vyssh. Uchebn. Zaved. Severo-Kavkaz. Reg. Ser. Estestv. Nauki No. 1, 21–26 (2011).
V. A. Skorokhodov, “Flows in Generalized Nets with Related Arcs,” Model. Anal. Inform. Sistem 19 (2), 41–52 (2012).
L. R. Ford and D. R. Fulkerson, Flows in Networks (Princeton Univ. Press, Princeton, 1962; Mir,Moscow, 1966).
R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications (Prentice Hall, Upper Saddle River, USA, 1993).
M. Fonoberova, “On Determining the Minimum Cost Flows in Dynamic Networks,” Bul. Acad. S¸ tiint¸e Repub. Mold.Mat., No. 1, 51–56 (2006).
A. V. Goldberg and S. Rao, “Beyond the Flow Decomposition Barrier,” J. ACM 45 (5), 783–797 (1998).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © V.A. Skorokhodov, A.S. Chebotareva, 2015, published in Diskretnyi Analiz i Issledovanie Operatsii, 2015, Vol. 22, No. 3, pp. 55–73.
Rights and permissions
About this article
Cite this article
Skorokhodov, V.A., Chebotareva, A.S. The maximum flow problem in a network with special conditions of flow distribution. J. Appl. Ind. Math. 9, 435–446 (2015). https://doi.org/10.1134/S199047891503014X
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S199047891503014X