Skip to main content
Log in

The use of classification theory for automated selection of algorithms in program packages

  • Published:
Cybernetics Aims and scope

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Literature Cited

  1. I. V. Sergienko, Mathematical Models and Methods of Solution of Discrete Optimization Problems [in Russian], Naukova Dumka, Kiev (1985).

    Google Scholar 

  2. Yu. I. Zhuravlev and V. V. Nikiforov, “Classification algorithms based on evaluation of estimates,” Kibernetika, No. 3, 1–11 (1971).

    Google Scholar 

  3. Yu. I. Zhuravlev, “An algebraic approach to classification problems,” Problemy Kibernetiki, No. 33, 5–68 (1978).

    Google Scholar 

  4. V. K. Korobkov, “On some integer linear programming problems,” Problemy Kibernetiki, No. 14, 297–301 (1965).

    Google Scholar 

Download references

Authors

Additional information

Translated from Kibernetika, No. 3, pp. 11–17, May–June, 1986.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhuravlev, Y.N., Sergienko, I.V., Artemenko, V.I. et al. The use of classification theory for automated selection of algorithms in program packages. Cybern Syst Anal 22, 270–278 (1986). https://doi.org/10.1007/BF01069965

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation