An upper bound on the number of cuts needed in Gomory's method of integer forms

The cut discipline of Gomory's first finiteness proof for the method of integer forms is used to derive an upper bound on the number of cuts required to obtain solution to pure integer programs.

Saved in:
Bibliographic Details
Published inOperations research letters Vol. 1; no. 4; pp. 129 - 133
Main Authors Nourie, Francis J., Venta, Enrique R.
Format Journal Article
LanguageEnglish
Published Elsevier B.V 1982
Subjects
algorithms
cutting planes
Integer programming
Integer programming
algorithms
cutting planes
Online AccessGet full text

Cover

More Information
Summary:The cut discipline of Gomory's first finiteness proof for the method of integer forms is used to derive an upper bound on the number of cuts required to obtain solution to pure integer programs.
ISSN:0167-6377
1872-7468
DOI:10.1016/0167-6377(82)90014-1