Skip to main content
SpringerLink
Log in

Synthesis of optimal hybrid minimization algorithms

  • 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. A. I. Zhdanok and L. A. Rastrigin, “A formal approach to the creation of adaptive structure of search algorithms,” in: Problems of Random Search [in Russian], No. 4 (1975), pp. 48–53.

  2. G. M. Adamenko, On the Solution of Classes of Minimization Problems [in Russian], Preprint Inst. Mat. Akad. Nauk BSSR, No. 11(11), Minsk (1976).

  3. D. A. Suprunenko, “On the values of a linear form on the set of permutations,” Kibernetika, No. 2, 59–63 (1968).

    Google Scholar 

  4. I. V. Gaishun, Multidimensional Discrete Systems [in Russian], Preprint Inst. Mat. Akad. Nauk BSSR, No. 10(10), Minsk (1976).

  5. V. S. Mikhalevich, “Sequential optimization algorithms and their application,” Kibernetika, Nos. 1–2, 45–55, 85–89 (1965).

    Google Scholar 

  6. Software for the EC Computers [in Russian], No. 17, Minsk (1978).

Download references

Authors
  1. G. M. Adamenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. I. V. Gaishun
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 3, pp. 91–94, May–June, 1980.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Adamenko, G.M., Gaishun, I.V. Synthesis of optimal hybrid minimization algorithms. Cybern Syst Anal 16, 406–409 (1980). https://doi.org/10.1007/BF01078260

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation