Abstract
AbstractA truncated cube, by which we mean the convex hull of a subset of the vertices of the unit cube, has an outer polar whose facets are a subset of the facets of the octahedron (the outer polar of the cube). We discuss procedures for generating valid truncations of the cube from the problem constraints, in the case of 0‐1 integer programs, and for intersecting the halflines defined by the constraints that are tight for a basic solution to the linear program, with successive facets of the outer polars of these truncated cubes. The cutting planes obtained in this way are compared to other cuts.
Sign-in/Register to access full text options 
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.
