Chva´tal closures for mixed integer programming problems
Mathematical Programming: Series A and B
MIP: Theory and Practice - Closing the Gap
Proceedings of the 19th IFIP TC7 Conference on System Modelling and Optimization: Methods, Theory and Applications
Inequalities from Two Rows of a Simplex Tableau
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
On the facets of mixed integer programs with two integer variables and two constraints
Mathematical Programming: Series A and B
Computing with multi-row gomory cuts
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Lifting integer variables in minimal inequalities corresponding to lattice-free triangles
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Operations Research Letters
Cook, Kannan and Schrijver's example revisited
Discrete Optimization
A Geometric Perspective on Lifting
Operations Research
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
Partial convexification of general MIPs by Dantzig-Wolfe reformulation
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
| Hi-index | 0.00 |
Recent advances on the understanding of valid inequalities from the infinite group relaxation has opened the possibility of finding a computationally effective extension to GMI cuts. In this paper, we investigate the computational impact of using a subclass of minimally valid inequalities from this relaxation on a wide set of instances.