Abstract
This paper focuses on the outer description of the convex hull of all integer solutions to a given system of linear inequalities. It is shown that if the given system contains lower and upper bounds for the variables, then the convex hull can be produced by iteratively generating so‐called mod‐2 cuts only. This fact is surprising and might even be counterintuitive, since many integer rounding cuts exist that are not mod‐2, i.e., representable as the $\{0,\frac{1}{2}\}$ combination of the given constraint system. The key, however, is that in general many more rounds of mod‐2 cut generation are necessary to produce the final description than in the traditional integer rounding procedure.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
