Skip to main content
SpringerLink
Log in

Constructing suboptimal schedules using directed search

  • 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. D. I. Golenko and Yu. I. Tarnopol'skii, “Optimization of schedules by the methods of directed search,” Kibernetika, No. 6 (1970).

  2. S. I. Zukhovitskii and I. A. Radchik, Mathematical Methods of Network Planning [in Russian], Nauka, Moscow (1965).

    Google Scholar 

  3. C. Kuratowski, Topologie, Vol. 1, Hafner (1958).

  4. L. A. Rastrigin, Statistical Methods of Search [in Russian], Nauka, Moscow (1968).

    Google Scholar 

Download references

Authors
  1. V. L. Kochnev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. P. Tarasov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 4, pp. 46–49, July–August, 1972.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kochnev, V.L., Tarasov, G.P. Constructing suboptimal schedules using directed search. Cybern Syst Anal 8, 576–580 (1972). https://doi.org/10.1007/BF01068278

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation