An Intersection Cut from the Dual of the Unit Hypercube

Abstract

This note extends the work of Balas (and the related work of Young) on intersection cuts for integer programming. Replacing the Euclidean hypersphere used by Balas with a convex polyhedron dual to the unit hypercube, we obtain a stronger intersection cut.