Integer points on the Gomory fractional cut (hyperplane)
Harvey M. Salkin and
Patrice Breining
Naval Research Logistics Quarterly, 1971, vol. 18, issue 4, 491-496
Abstract:
In this paper we show that the Gomory fractional cut (hyperplane) for the integer program is either void of integer points or contains an infinite number of them. The conditions for each case are presented. Also, we derive a stronger cut from the hyperplane which does not intersect integer points.
Date: 1971
References: Add references at CitEc
Citations:
Downloads: (external link)
https://doi.org/10.1002/nav.3800180407
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:wly:navlog:v:18:y:1971:i:4:p:491-496
Access Statistics for this article
More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().