Technical Note—Strengthened Dantzig Cuts for Integer Programming

David S. Rubin and Robert L. Graves
Additional contact information
David S. Rubin: University of North Carolina, Chapel Hill, North Carolina
Robert L. Graves: University of Chicago, Chicago, Illinois

Operations Research, 1972, vol. 20, issue 1, 178-182

Abstract: In 1959, Dantzig proposed a particularly simple cut for integer programming. However, in 1963, Gomory and Hoffman showed that, in general, this cut does not provide a finite algorithm. In 1968, Bowman and Nemhauser showed that a slightly modified version of the Dantzig cut does provide a finite procedure. We show how this latter cut can be strengthened through the use of group-theoretic techniques.

Date: 1972
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.20.1.178 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:20:y:1972:i:1:p:178-182

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().