Skip to main content
SpringerLink
Log in

A branches and bounds method for optimizing the structural parameters of automatic lines

  • 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. V. S. Mikhalevich, “Sequential algorithms and their application,” Kibernetika, Nos. 1 and 2 (1965).

  2. V. V. Shkurba, “Constructive approaches to the solution of discrete optimization problems,” in Fourth Symposium on Extremal Problems [in Russian], Kaunas (1969).

  3. V. V. Shkurba and B. I. Yukhimenko, “The branches and bounds scheme in integer programming problems with Boolean variables,” in: Technology of Industrial Production [in Russian], Kiev (1969).

  4. G. M. Britavskii, “Some questions of computer simulation of multichannel multiphase queuing systems,” in: Industrial Cybernetics [in Russian], Izd. Inst. Kibernetiki Akad. Nauk UkrSSR, Kiev (1971).

    Google Scholar 

Download references

Authors
  1. G. M. Britavskii
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. B. I. Yukhimenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 2, pp. 102–104, March–April, 1976.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Britavskii, G.M., Yukhimenko, B.I. A branches and bounds method for optimizing the structural parameters of automatic lines. Cybern Syst Anal 12, 279–282 (1976). https://doi.org/10.1007/BF01069901

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation