Skip to main content
Log in

The application of the fall-vector method in decomposition schemes for the solution of integer linear programming problems

  • 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. N. Z. Shor, Minimization Methods for Nondifferentiable Functions and Their Applications [in Russian], Naukova Dumka, Kiev (1979).

    Google Scholar 

  2. I. Kornai (J. Kornai) and T. Liptak (T. Lipták), “Planning on two levels,” in: Application of Mathematics in Economic Studies [in Russian], Mysl', Moscow (1965), pp. 17–25.

    Google Scholar 

  3. I. V. Sergienko, T. T. Lebedeva, and V. A. Roshchin, Approximate Methods of Solving Discrete Optimization Problems [in Russian], Naukova Dumka, Kiev (1980).

    Google Scholar 

Download references

Authors

Additional information

Translated from Kibernetika, No. 1, pp. 44–47, January–February, 1984.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sergienko, I.V., Golodnikov, A.N. The application of the fall-vector method in decomposition schemes for the solution of integer linear programming problems. Cybern Syst Anal 20, 65–71 (1984). https://doi.org/10.1007/BF01068870

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation