cutting-plane methods have enabled remarkable successes in integer
programming over the last few decades. State-of-the-art solvers integrate a
myriad of cutting-plane techniques to speed up the underlying tree-search
algorithm used to find optimal solutions. In this paper we prove the