Chva´tal closures for mixed integer programming problems
Mathematical Programming: Series A and B
Worst-case comparison of valid inequalities for the TSP
Mathematical Programming: Series A and B
Optimizing over the split closure
Mathematical Programming: Series A and B
Inequalities from Two Rows of a Simplex Tableau
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
On an Analysis of the Strength of Mixed-Integer Cutting Planes from Multiple Simplex Tableau Rows
SIAM Journal on Optimization
On the relative strength of split, triangle and quadrilateral cuts
Mathematical Programming: Series A and B
A probabilistic analysis of the strength of the split and triangle closures
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Hi-index | 0.00 |
We consider mixed integer linear sets defined by two equations involving two integer variables and any number of non-negative continuous variables. We analyze the benefit from adding a non-split inequality on top of the split closure. Applying a probabilistic model, we show that the importance of a type 2 triangle inequality decreases with decreasing lattice width, on average. Our results suggest that this is also true for type 3 triangle and quadrilateral inequalities.