An Intersection Cut from the Dual of the Unit Hypercube

1 February 1971

journal article
Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research

Vol. 19 (1) , 40-44
https://doi.org/10.1287/opre.19.1.40

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.

Keywords

DUAL
INTERSECTION CUT
UNIT HYPERCUBE
REPLACING
INTEGER
HYPERSPHERE
NOTE
STRONGER