Skip to main content
SpringerLink
Log in

A class of problems solved by sequential analysis of versions

  • 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. M. M. Kovalev, Discrete Optimization (Integer Programming) [in Russian], Beloruss. Gos. Univ., Minsk (1977).

    Google Scholar 

  2. R. Bellman and S. Dreyfus, Aplied Dynamic Programming, Princeton University Press, Princeton, N. J. (1959).

    Google Scholar 

  3. I. V. Romanovskii, “Methods of implicit sifting used for solving integer programming problems with bivalent variables,” Izv. Vyssh. Uchebn. Zaved., Matematika, No. 4, 17–29 (1970).

    Google Scholar 

  4. V. S. Mikhalevich, N. Z. Shor, et al., Computational Methods of Selection of Optimal Design Solutions [in Russian], Naukova Dumka, Kiev (1977).

    Google Scholar 

  5. S. N. Trushin, “Determination of largest internally stable sets of a graph by sequential analysis of versions,” Kibernetika, No. 5, 33–41 (1980).

    Google Scholar 

Download references

Authors
  1. S. N. Trushin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 5, pp. 99–106, September–October, 1981.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Trushin, S.N. A class of problems solved by sequential analysis of versions. Cybern Syst Anal 17, 678–687 (1981). https://doi.org/10.1007/BF01068791

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation