On the practical strength of two-row tableau cuts

Following the flurry of recent theoretical work on cutting planes from two-row mixed integer group relaxations of an LP tableau, we report on computational tests to evaluate the strength of two-row cuts based on lattice-free triangles having more than one integer point on one side. A heuristic procedure to generate such triangles (referred to in the literature as “type 2 ” triangles) is presented, and then the coefficients of the integer variables are tightened by lifting. To test the effectiveness of triangle cuts, we compare the gap closed using Gomory mixed integer cuts for one round, the gap closed in one round using all the triangle cuts generated by our heuristic and the gap closed by a small number of two-row split cuts. Our tests are carried out on randomly generated instances designed to represent different problem features by varying the number of integer non-basic variables, bounds, non-negativity constraints and density, as well as on the classical MIPLIB instances. The outcome of this computational analysis is some insight into key characteristics of MIP instances whose presence makes two-row triangle cuts computationally effective. In particular it appears to be necessary that the tableau row pairs are dense, and more subjectively that the non-basic continuous variables are “important”. Unfortunately these characteristics seem rarely to be present among real life instances, and more specifically the tableau rows of the MIPLIB instances are far from dense. A preliminary version of this work has been published in [18].