In this talk we study mixed-integer programs (MIP) defined by a single constraint and variable bounds. This subclass of problems is important to derive cutting planes for general MIPs.

We present both theoretical and computational developments in the area, deriving a new framework for generating cuts and analyzing computational issues that arise in the study of such systems.