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.
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.