Skip to main content
SpringerLink
Log in

Strongly polynomial algorithms for finding minimax paths in networks and solution of cyclic games

  • Systems Analysis
  • Published:
Cybernetics and Systems Analysis Aims and scope

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

References

  1. V. A. Gurvich, A. V. Karzanov, and L. G. Khachiyan, “Cyclic games and finding minimax mean cycles in oriented graphs,” Zh. Vychisl. Mat, Mat. Fiz.,29, No. 9, 1407–1417 (1990).

    Google Scholar 

  2. V. A. Gurvich and V. N. Lebedev, “Tests for and verification of ergodicity of cyclic game forms,” Usp. Mat. Nauk,44, No. 1, 193–194 (1990).

    Google Scholar 

  3. H. Moulin, “Prolongement des jeux a deux joueurs de somme nolle,” Bull. Soc. Math. France,45 (1976).

  4. D. D. Lozovanu. “Algorithms for solution of some classes of network minimax problems and their applications,” Kibernetika, No. 1, 70–75 (1991).

    Google Scholar 

  5. V. S. Mikhalevich, V. A. Trubin, and N. Z. Shor, Optimization Problems of Industrial Transport Planning [in Russian], Nauka, Moscow (1986).

    Google Scholar 

Download references

Authors
  1. D. D. Lozovanu
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 5, pp. 145–151, September–October, 1993.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lozovanu, D.D. Strongly polynomial algorithms for finding minimax paths in networks and solution of cyclic games. Cybern Syst Anal 29, 754–759 (1993). https://doi.org/10.1007/BF01125805

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation