Skip to main content
SpringerLink
Log in

Method of elimination of a group of unknown flows in networks with the generalized kirchhoff law

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

Flows are considered in networks for which the difference of incoming a fid outgoing flows for some node belongs to some interval. The interval depends on the consumption at the node. For this case, a method is developed to eliminate a group of unknown flows in a terminal or intermediate subgraph.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. V. E. Danirchenko, V. V. Ostapenko, and A. P. Yakovleva, “Method of operating control of a system with a complex structure,” Kib. Vychisl. Tekh., No. 69, 82–86 (1986).

    Google Scholar 

  2. V. V. Ostapenko and A. P. Yakovleva, “Mathematical questions of modeling and control in water distribution problems,” Control Cybern., 20, No. 4, 99–111 (1991).

    MathSciNet  Google Scholar 

  3. V. V. Ostapenko and G. S. Finin, “Mathematical simulation in problems of integration of irrigation schedules,” Avtomatika, No. 5, 77–82 (1992).

  4. S. E. Lovetskii and I. I. Melamed, “Dynamic flows in networks,” Avtomat. Telemekh., No. 11, 7–29 (1987).

  5. S. E. Lovetskii and I. I. Melamed, “Optimal control of transport flows,” in: Control in Transport Systems, Inst. Probl. Upr., Moscow (1985), pp. 5–8.

  6. V. V. Ostapenko and A. I. Pavlygin, “Dynamic network flows for the generalized Kirchhoff law,” Kibern. Sist. Anal., No. 3, 96–102 (1996).

  7. V. V. Ostapenko, A. I. Pavlygin, and G. S. Finin, “The generalized principle of conservation of flows in networks,” Proc. of the 3rd Ukrainian Conference in Automatic Control “Avtomatika 96,” Vol. 2, Sevastopol, SevGTU (1996).

    Google Scholar 

  8. V. V. Ostapenko and G. S. Finin, “The method of elimination of unknowns for systems of linear inequalities with graph structure of a graph,” Kibern. Sist. Anal., No. 5, 66–74 (1999).

  9. V. A. Emeiichev, O. I. Mel’nikov, V. I. Sarvalov, and R. I. Tyshkevich, Lectures on the Theory of Graphs [in Russian], Nauka, Moscow (1990).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Solomon International Institute, Kiev, Ukraine

    G. S. Finin

Authors
  1. G. S. Finin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 154–159, November–December, 1999.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Finin, G.S. Method of elimination of a group of unknown flows in networks with the generalized kirchhoff law. Cybern Syst Anal 35, 976–980 (1999). https://doi.org/10.1007/BF02742291

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02742291

Keywords

Search

Navigation