Skip to main content
SpringerLink
Log in

Algorithm of the Generalized Method of Potentials for the Problem of Optimal Linear Synthesis of a Communication Network

  • SYSTEMS ANALYSIS AND OPERATIONS RESEARCH
  • Published:
Journal of Computer and Systems Sciences International Aims and scope

Abstract

A new efficient algorithm for solving the linear separable problem of the synthesis of a communication network called the generalized method of potentials is considered and justified. It is a generalization of the known method of potentials for solving the standard transportation problem. The finiteness of the proposed algorithm is proved.

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

Fig. 1.
Fig. 2.
Fig. 3.
Fig. 4.
Fig. 5.
Fig. 6.
Fig. 7.

Similar content being viewed by others

REFERENCES

  1. I. V. Romanovskii, Algorithms for Solving Extremal Problems (Nauka, Moscow, 1977) [in Russian].

    Google Scholar 

  2. V. Yu. Lemeshko, Optimization Methods: Lectures (Novosib. Gos. Univ., Novosibirsk, 2009) [in Russian].

    Google Scholar 

  3. L. G. Raskin and I. O. Kirichenko, Multi-Index Linear Programming Problems (Radio Svyaz’, Moscow, 1982) [in Russian].

    MATH  Google Scholar 

  4. O. V. Seraya, Multidimensional Logistics Models under Uncertainty (I. I. Stetsenko, Kharkov, 2010) [in Russian].

    Google Scholar 

  5. P. V. Konyukhovskii, Mathematical Methods of Operations Research in Economics (Piter, St. Petersburg, 2000) [in Russian].

    Google Scholar 

  6. D. Gale, The Theory of Linear Economic Models (Univ. Chicago Press, Chicago, 1963).

  7. E. G. Davydov, Games, Graphs, Resources (Radio Svyaz’, Moscow, 1981) [in Russian].

    MATH  Google Scholar 

  8. G. M. Adel’son-Vel’skii, E. A. Dinits, and A. V. Karzanov, Flow Algorithms (Nauka, Moscow, 1975) [in Russian].

    Google Scholar 

  9. R. G. Busacker and T. L. Saaty, Finite Graphs and Networks: an Introduction with Applications (McGraw-Hill, New York, 1965; Nauka, Moscow, 1974).

Download references

Author information

Authors and Affiliations

  1. Moscow State University, 119991, Moscow, Russia

    O. A. Kosorukov

  2. Plekhanov Russian University of Economics, 115093, Moscow, Russia

    O. O. Boldina, E. V. Lavrushina & N. V. Ponomareva

Authors
  1. O. O. Boldina
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. O. A. Kosorukov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. E. V. Lavrushina
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. N. V. Ponomareva
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to O. A. Kosorukov.

Additional information

Translated by A. Klimontovich

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Boldina, O.O., Kosorukov, O.A., Lavrushina, E.V. et al. Algorithm of the Generalized Method of Potentials for the Problem of Optimal Linear Synthesis of a Communication Network. J. Comput. Syst. Sci. Int. 58, 626–636 (2019). https://doi.org/10.1134/S1064230719040026

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1064230719040026

Search

Navigation