Abstract: | A 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. |