Skip to main content
SpringerLink
Log in

Network optimization and problems with coupling variables

  • Systems Analysis and Operations Research
  • Published:
Journal of Computer and Systems Sciences International Aims and scope

Abstract

Network optimization problems are considered. Their statements include numerous variables and equipments. Decomposition methods are used for their solution. In specific situations, intermediate problems solved by the algorithms have the form of the knapsack problem. In the case when the constraints have a staircase structure, an efficient algorithm can be constructed. The procedure for the sequential recalculation of the coefficients of the objective function in this algorithm can be applied to other problems with unimodular matrices, in particular, to various transportation problems.

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. T. C. Hu, Integer Programming and Network Flows (Addison-Wesley, Reading, Mass., 1970; Mir, Moscow, 1974).

    Google Scholar 

  2. Yu. E. Malashenko, “A normative approach to the analysis multicommodity networks,” Sov. J. Comput. Syst. Sci. 26(6), 9–13 (1988).

    MATH  MathSciNet  Google Scholar 

  3. Yu. E. Malashenko and E. M. Novikova, “A generalized problem of multicommodity network analysis,” Izv. Akad. Nauk SSSR, Tekhn. Kibern., No. 4, 75–89 (1989).

    Google Scholar 

  4. A. A. Mironov, T. A. Levkina, and V. I. Tsurkov, “Minimax estimations of arc weights in integer networks with fixed node degrees,” Appl. Comput. Math. 8, 216–226 (2009).

    MATH  MathSciNet  Google Scholar 

  5. A. A. Mironov and V. I. Tsurkov, “Network Models with Fixed Parameters at the Communication Nodes. I,” J. Comput. Syst. Sci. Int. 33(3), 107–116 (1995).

    MathSciNet  Google Scholar 

  6. A. A. Mironov and V. I. Tsurkov, “Network Models with Fixed Parameters at the Communication Nodes. II,” J. Comput. Syst. Sci. Int. 32(6), 1–11 (1994).

    MathSciNet  Google Scholar 

  7. A. P. Tizik and V. I. Tsurkov, “Optimal channel distribution in communications networks,” Sov. J. Comput. Syst. Sci. 28(2), 24–31 (1990).

    MATH  Google Scholar 

  8. L. S. Lasdon, Optimization Theory for Large Systems (Macmillan, New York, 1970; Nauka, Moscow, 1975).

    MATH  Google Scholar 

  9. V. I. Tsurkov, Decomposition in Large-Scale Problems (Nauka, Moscow, 1981) [in Russian].

    Google Scholar 

  10. V. I. Tsurkov, “An iterative method of the decomposition for extremal problems,” Dokl. Akad. Nauk SSSR 250(2), 304–307 (1980).

    MathSciNet  Google Scholar 

  11. V. I. Tsurkov, “Some classical trends in the decomposition of large dynamical systems (a survey),” Sov. J. Comput. Syst. Sci. 25(5), 39–47 (1987).

    MATH  MathSciNet  Google Scholar 

  12. L. G. Dumbadze, A. P. Tizik, and Yu. P. Treskov, “The problem of efficient network operation,” J. Comput. Syst. Sci. Int. 42, 935–938 (2003).

    MATH  Google Scholar 

  13. L. G. Dumbadze and A. P. Tizik, “Many-Dimensional Knapsack Problem of a Special Ladder Structure,” J. Comput. Syst. Sci. Int. 35, 614–617 (1996).

    MATH  Google Scholar 

  14. E. G. Gol’shtein and D. B. Yudin, Linear Programming Problems of Transportation Type (Nauka, Moscow, 1969) [in Russian].

    MATH  Google Scholar 

  15. A. P. Tizik and V. I. Tsurkov, “Iterative functional modification method for solving a transportation problem,” Autom. Remote Control 73, 134–143 (2012).

    Article  Google Scholar 

  16. A. P. Tizik, D. I. Kuzovlev, and A. A. Sokolov, “Iterative functional modification method for a transportation problem with additional supply and consumption sites,” Vestn. Tver Gos. Univ., Ser. Prikl. Mat., No. 4, 91–98 (2012).

    Google Scholar 

  17. A. A. Sokolov, A. P. Tizik, and V. I. Tsurkov, “Iterative method for the transportation problem with additional supply and consumption points and quadratic cost,” J. Comput. Syst. Sci. Int. 52, 588–598 (2013).

    Article  MathSciNet  Google Scholar 

  18. A. A. Mironov and V. I. Tsurkov, “Closed transportation models with minimax criterion,” Autom. Remote Control 63(3), 388–398 (2002).

    Article  MATH  MathSciNet  Google Scholar 

  19. A. A. Mironov and V. I. Tsurkov, “Open transportation models with minimax criterion,” Dokl. Math. 64, 374–377 (2001).

    Google Scholar 

  20. A. A. Mironov and V. I. Tsurkov, “Minimax Transportation Models with Integral Constraints. I,” J. Comput. Syst. Sci. Int. 42, 562–574 (2003).

    MATH  Google Scholar 

  21. A. A. Mironov, V. V. Fedorchuk, and V. I. Tsurkov, “Minimax Transportation Models with Integral Constraints. II,” J. Comput. Syst. Sci. Int. 44, 732–752 (2005).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dorodnicyn Computing Center, Russian Academy of Sciences, ul. Vavilova 40, Moscow, 119333, Russia

    A. S. Esenkov, D. I. Kuzovlev, V. Yu. Leonov, A. P. Tizik & V. I. Tsurkov

Authors
  1. A. S. Esenkov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. I. Kuzovlev
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. V. Yu. Leonov
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. A. P. Tizik
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. V. I. Tsurkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to V. I. Tsurkov.

Additional information

Original Russian Text © A.S. Esenkov, D.I. Kuzovlev, V.Yu. Leonov, A.P. Tizik, V.I. Tsurkov, 2014, published in Izvestiya Akademii Nauk. Teoriya i Sistemy Upravleniya, 2014, No. 3, pp. 71–85.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Esenkov, A.S., Kuzovlev, D.I., Leonov, V.Y. et al. Network optimization and problems with coupling variables. J. Comput. Syst. Sci. Int. 53, 369–383 (2014). https://doi.org/10.1134/S1064230714030071

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation