Skip to main content
SpringerLink
Log in

An algorithm for solving a class of problems in linear programming with Boolean variables

  • 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. I. I. Pyatetskii-Shapiro, V. A. Volkonskii, L. V. Levina, and A. Pomanskii, “An iterative method of solving problems in integer programming,” Dokl. Akad. Nauk SSSR,169, no. 6, Moscow, (1966).

  2. E. Balas, “An additive algorithm for solving linear programs with zero-one variables,” Operations Research,12, no. 3 (1965).

  3. J. Little, K. Murthy, D. Sweeny and K. Kerel, “An algorithm for solving the traveling salesman problem,” Ekonomika i matematicheskie metody,1, no. 1, Moscow (1965).

  4. E. L. Lawler and D. E. Wood, “Branch-and-bound methods: a survey,” Operational Research,14, no. 4 (1966).

  5. M. L. Balinski, “Integer programming: methods, uses, computation,” Management Sciences,12, no. 3 (1965).

  6. V. N. Burkov, “Distribution of resources as a problem in optimal speed of response,” Avtomatika i telemekhanika, no. 7, Moscow (1966).

  7. V. S. Mikhalevich and V. V. Shkurba, “Sequential optimization methods in problems of operation scheduling,” Kibernetika [Cybernetics], no. 2, Kiev (1966).

  8. E. G. Gol'shtein, “Separable programming methods, II,” Ekonomika i matematicheskie metody, no. 1, Moscow (1966).

  9. F. Glover, “A note on the additive algorithm of Balas,” Operations Research,12, no. 2 (1965).

Download references

Authors
  1. A. V. Krushevskii
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. A. Polyak
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. E. Primak
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Kiev State University Gosplan Computer Center, Ukrainian SSR, Kiev. Translated from Kibernetika, Vol. 5, No. 3, pp. 68–73, May–June, 1969.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Krushevskii, A.V., Polyak, R.A. & Primak, M.E. An algorithm for solving a class of problems in linear programming with Boolean variables. Cybern Syst Anal 5, 319–325 (1969). https://doi.org/10.1007/BF01070920

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation