Skip to main content
SpringerLink
Log in

A method for the solution of monotonic 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

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. R. M. Karp, “Reducibility among combinatorial problems,” in: R. E. Miller and J. W. Thatcher, ed., Complexity of Computer Computations, Plenum, New York (1972).

    Google Scholar 

  2. V. K. Korobkov, “Some integer linear programming problems,” in: Probl. Kibernetiki, No. 14, Fizmatgiz, Moscow (1965).

    Google Scholar 

  3. K. R. Shvarts, “Methods of solution of discrete problems,” in: Applications of Mathematics in Economics [in Russian], No. 3, Leningrad State Univ. (1973).

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

Download references

Authors
  1. V. Ya. Nasekin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 5, pp. 106–109, September–October, 1979.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nasekin, V.Y. A method for the solution of monotonic integer linear programming problems. Cybern Syst Anal 15, 719–723 (1979). https://doi.org/10.1007/BF01071225

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation