Technical Note—Stronger Inequalities for 0-1 Integer Programming: Computational Refinements

Abstract

This paper presents computational refinements to minimize the number of iterations involved in finding stronger cuts and constraints for 0-1 integer programming by the method presented in an earlier paper, “Stronger Inequalities for 0, 1 integer Programming Using Knapsack Functions.” We show that the savings in number of iterations between an optimally-sequenced cut-strengthening procedure and the procedure of the author's earlier paper can be very substantial. For example, for strengthening a cut with 200 0-1 variables this reduction can be 17,250 iterations.