Skip to main content
SpringerLink
Log in

Efficiency of Algorithms for Solution of Network Problems with Tree-Like Data Structure

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

It is shown that the running time of a special simplex algorithm for solution of practical network problems is improved if a tree-like structure is used to store data.

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. A. Aho, J. Hopcroft, and J. Ulman, Construction and Analysis of Computational Algorithms [Russian translation], Mir, Moscow (1979).

    Google Scholar 

  2. M. Fredman and R. G. Tarjan, “Fibonacci heaps and their improved network optimization algoritims,” in: Proc. 25th Ann. Symp. Foundation of Computer Science (1984), pp. 338-346.

  3. P. Kleinschmiidt and H. Schannath, “A strongly polynomial algorithm for the transportation problem,” Math. Prog., 68, 1-13 (1995).

    Google Scholar 

  4. J. Orlin, “A faster strongly polynomial minimum cost flow algorithm,” in: Proc. 20th ACM Symp. on the Theory of Computation (1988), pp. 377-387.

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

    Google Scholar 

  6. M. L. Balinski, “The Hirsch conjecture for dual transportation polyhedra,” Math. Oper. Res., 9, 629-633 (1984).

    Google Scholar 

  7. M. L. Bronshtein and K. V. Kim, “Programs for solution of the transportation problem in a network and matrix settings,” Progr. Algor., Issue 72, TsEMI AN SSSR, Moscow (1976), pp. 15-22.

    Google Scholar 

  8. K. V. Kim, “On labor-consumption of some simple problems: Abstracts of priority results in mathematical programming,” Inform. Byul. Ekaterinburg, No. 9, Pt. 1, 99-103 (2001).

Download references

Author information

Authors and Affiliations

  1. National Academy of Sciences of Ukraine, V. M. Glushkov Institute of Cybernetics, Kiev, Ukraine

    F. A. Sharifov

Authors
  1. F. A. Sharifov
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sharifov, F.A. Efficiency of Algorithms for Solution of Network Problems with Tree-Like Data Structure. Cybernetics and Systems Analysis 39, 467–470 (2003). https://doi.org/10.1023/A:1025726030861

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1025726030861

Search

Navigation