Skip to main content
SpringerLink
Log in

Bounding algorithm for the routing problem with arbitrary paths and alternative servers

  • Published:
Cybernetics 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

Literature Cited

  1. I. S. Belov and Ya. N. Stolin, “An algorithm in a single-path operations scheduling problem,” in: Mathmatical Economics and Functional Analysis [in Russian], Nauka, Moscow (1974), pp. 248–257.

    Google Scholar 

  2. S. V. Sevast'yanov, “On an asymptotic approach to some problems in scheduling theory,” Abstracts of papers at 3rd All-Union Conf. on Problems of Theoretical Cybernetics [in Russian], VTs SO AN SSSR, Novosibirsk (1974), pp. 67–69.

    Google Scholar 

  3. N. I. Glebov and V. A. Perepelitsa, “On upper and lower bounds for one problem in scheduling theory,” Studies in Cybernetics [in Russian], Sovetskoe Radio, Moscow (1970), pp. 11–17.

    Google Scholar 

  4. V. A. Perepelitsa, “On a problem of scheduling theory,” Kibernetika, No. 5, 75–78 (1966).

    Google Scholar 

  5. V. E. Khenkin, “On one question in scheduling theory,” Kibernetika, No. 6, 67–71 (1966).

    Google Scholar 

  6. V. E. Khenkin, “On some sequences of permutations arising in scheduling theory,” Probl. Kibern., No. 20, 231–240 (1968).

    Google Scholar 

  7. A. I. Babushkin, A. L. Bashta, and I. S. Belov, “Scheduling for the problem of counterdirected paths,” Kibernetika, No. 4, 130–135 (1977).

    Google Scholar 

  8. A. I. Babushkin, A. L. Bashta, and I. S. Belov, “Scheduling in a multipath three-machine problem,” Avtomat. Telemekh., No. 7, 154–158 (1976).

    Google Scholar 

  9. S. V. Sevast'yanov, “Approximate algorithms in Johnson problems and vector summations,” Upr. Sist., No. 20, 64–73 (1980).

    Google Scholar 

  10. G. M. Adel'son-Vel'skii et al., Flow Algorithms [in Russian], Nauka, Moscow (1975).

    Google Scholar 

  11. E. M. Livshits, “A study of some optimization algorithms for network models,” Ekonomika, Mat. Metody,4, No. 5, 768–775 (1968).

    Google Scholar 

  12. S. V. Sevast'yanov, “Some generalization of the Johnson problem,” Upr. Sist., No. 21, 45–61 (1981).

    Google Scholar 

  13. S. V. Sevast'yanov, “Bounding algorithms for the Johnson and Akers-Friedman problem in the three-machine case,” Upr. Sist., No. 22, 51–57 (1982).

    Google Scholar 

Download references

Authors
  1. S. V. Sevast'yanov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 6, pp. 74–79, November–December, 1986.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sevast'yanov, S.V. Bounding algorithm for the routing problem with arbitrary paths and alternative servers. Cybern Syst Anal 22, 773–781 (1986). https://doi.org/10.1007/BF01068694

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation