Skip to main content
SpringerLink
Log in

A finite cutting-plane algorithm for integer linear peogeamming with a noninteger objective function

  • Brief Communications
  • Published:
Ukrainian Mathematical Journal 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. A. A. Botyakov, “Integer programming, comparison of cutting planes,” Ékonomika i Matem. Metody,8, No. 1 (1972).

  2. Yu. Yu. Chervak, “Solution of discrete linear programming problems by lexicographic search,” Ékonomika i Matem. Metody,9, No. 6 (1973).

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Uzhgorod State University, USSR

    N. K. Chervak

Authors
  1. N. K. Chervak
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 27, No. 1, pp. 134–137, January–February, 1975.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chervak, N.K. A finite cutting-plane algorithm for integer linear peogeamming with a noninteger objective function. Ukr Math J 27, 111–113 (1975). https://doi.org/10.1007/BF01085853

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation