Skip to main content
Log in

An applied problem of discrete programming

  • 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. A. S. Nikitin, “Optimal distribution and choice of the number of registers in a digital computer by means of integer linear programming,” in: Problems of Theoretical Cybernetics, [in Russian], Naukova Dumka, Kiev (1965).

    Google Scholar 

  2. V. P. Koryachko and Yu. M. Korshunov, “On a formal choice of structures of digital automatic devices,” in: Theory of Automata and Methods of Formalized Synthesis of Computing Machines and Systems [in Russian], No. 3, Izd. IK AN USSR, Kiev (1968).

    Google Scholar 

  3. O. Lange, Optimal Decisions, Pergamon (1970).

  4. C. Berge, The Theory of Graphs and Its Applications [Russian translation], IL, Moscow (1962).

    Google Scholar 

  5. Yu. M. Korshunov and V. P. Koryachko, “The working out of preferences when assessing apparatus for statistical analysis of random processes,” Proceedings of the 2nd All-Union Symposium “Methods of Representation and Apparatus Analysis of Random Processes and Fields” [in Russian], Novosibirsk (1969).

  6. F. R. Gantmacher, Theory of Matrices [Russian translation], Nauka, Moscow (1967).

    Google Scholar 

Download references

Authors

Additional information

Translated from Kibernetika, No. 2, pp. 7–9, March–April, 1973.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Koryachko, V.P. An applied problem of discrete programming. Cybern Syst Anal 9, 193–196 (1973). https://doi.org/10.1007/BF01069072

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation