Skip to main content
SpringerLink
Log in

Some algorithms for solving linear programming problems with zero-one variables

  • Brief Communications
  • 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. B. K. Korobkov, A supplement to the Russian translation of E. Balas's “An additive algorithm for solving linear programming problems with zero-one variables,” in: Kiberneticheskii Sb. Novaya Ser., No. 6, Mir, Moscow (1969).

    Google Scholar 

  2. V. P. Grishukhin, “Estimating the complexity of Balas's algorithm,” in: Mathematical Methods for Economic Problem Solving [in Russian], No. 3, Nauka, Moscow (1972).

    Google Scholar 

  3. V. P. Grishukhin, “The mean number of iterations of Balas's algorithm,” in: Studies in Discrete Mathematics [in Russian], Nauka, Moscow (1973).

    Google Scholar 

  4. A. A. Korbut and Yu. Yu. Finkel'shtein, Discrete Programming [in Russian], Nauka, Moscow (1969).

    Google Scholar 

  5. A. A. Panchenko, “Some algorithms for the solution of particular linear programming problems with zero-one variables,” Kibernetika, No. 2 (1976).

  6. I. V. Vengerova and Yu. Yu. Finkel'shtein, “The efficiency of the branch-and-bound method,” Ekonomika Mat. Metody, 10, No. 1 (1975).

  7. V. V. Shkurba and B. I. Yukhimenko, “The convergence of a modification of the branch-and-bound method for solving the integer linear programming problem with zero-one variables,” in: Theory of Optimal Solutions [in Russian], No. 3, Izd. Inst. Kibernet. Akad. Nauk Ukr. SSR, Kiev (1969).

    Google Scholar 

  8. B. I. Yukhimenko, “The block approach to the solution of integer linear-programming problems by the branch-and-bound method,” in: Theoretical and Methodological Principles of Automatic Control System Design [in Russian], Moscow (1974).

Download references

Authors
  1. B. I. Yukhimenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 5, pp. 141–143, September–October, 1979.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yukhimenko, B.I. Some algorithms for solving linear programming problems with zero-one variables. Cybern Syst Anal 15, 760–763 (1979). https://doi.org/10.1007/BF01071235

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation