Split Rank of Triangle and Quadrilateral Inequalities

References

• Andersen K., Cornuéjols G., Li Y. Split closure and intersection cuts. Math. Programming (2005) 102(3):457–493Crossref, Google Scholar
• Andersen K., Louveaux Q., Weismantel R. Mixed-integer sets from two rows of two adjacent simplex bases. Math. Programming (2010) 124(1–2):455–480Crossref, Google Scholar
• Andersen K., Wagner C., Weismantel R. On an analysis of the strength of mixed integer cutting planes from multiple simplex tableau rows. SIAM J. Optim. (2009) 20(2):967–982Crossref, Google Scholar
• Andersen K., Louveaux Q., Weismantel R., Wolsey L., Fischetti M., Williamson D. P. Cutting planes from two rows of a simplex tableau. Proc. 12th Conf. Integer Programming and Combinatorial Optim. (2007) (Springer-Verlag, Berlin/Heidelberg) 1–15Google Scholar
• Balas E. Intersection cuts—A new type of cutting planes for integer programming. Oper. Res. (1971) 19(1):19–39Link, Google Scholar
• Balas E. Disjunctive programming. Ann. Discrete Math. (1979) 5:3–51Crossref, Google Scholar
• Balas E., Saxena A. Optimizing over the split closure. Math. Programming (2008) 113(2):219–240Crossref, Google Scholar
• Balas E., Ceria S., Cornuéjols G. A lift-and-project cutting plane algorithm for mixed integer 0-1 programs. Math. Programming (1993) 58(1–3):295–324Crossref, Google Scholar
• Basu A., Bonami P., Cornuéjols G., Margot F. On the relative strength of split, triangle, and quadrilateral cuts. Math. Programming (2011) 126(2):281–314Crossref, Google Scholar
• Basu A., Conforti M., Cornuéjols G., Zambelli G. Maximal lattice-free convex sets in linear subspaces. Math. Oper. Res. (2010) 35(3):704–720Link, Google Scholar
• Basu A., Conforti M., Cornuéjols G., Zambelli G. Minimal inequalities for an infinite relaxation of integer programs. SIAM J. Discrete Math. (2010) 24(1):158–168Crossref, Google Scholar
• Borozan V., Cornuéjols G. Minimal inequalities for integer constraints. Math. Oper. Res. (2009) 34(3):538–546Link, Google Scholar
• Conforti M., Cornuéjols G., Zambelli G. A geometric perspective on lifting. Oper. Res. (2011) . ForthcomingGoogle Scholar
• Cook W. J., Kannan R., Schrijver A. Chvátal closures for mixed integer programming problems. Math. Programming (1990) 58(2):155–174Crossref, Google Scholar
• Cornuéjols G., Li Y. Elementary closures for integer programs. Oper. Res. Lett. (2001) 28(1):1–8Crossref, Google Scholar
• Cornuéjols G., Margot F. On the facets of mixed integer programs with two integer variables and two constraints. Math. Programming (2009) 120(2):429–456Crossref, Google Scholar
• Dash S., Günlük O. On mixing inequalities: Rank, closure and cutting plane proofs. SIAM J. Optim. (2009) 20(2):1090–1109Crossref, Google Scholar
• Dash S., Günlük O., Lodi A., Fischetti M., Williamson D. P. On the MIR closure of polyhedra. Proc. 12th Conf. Integer Programming and Combinatorial Optim. (2007) (Springer-Verlag, Berlin/Heidelberg) 337–351Google Scholar
• Dash S., Günlük O., Lodi A. MIR closures of polyhedral sets. Math. Programming (2010) 121(1):33–60Crossref, Google Scholar
• Dey S. S. A note on the split rank of intersection cuts. Math. Programming (2011) . 10.1007/s10107-009-0329-yGoogle Scholar
• Dey S. S., Richard J.-P. P., Fischetti M., Williamson D. P. Sequential-merge facets for two-dimensional group problems. Proc. 12th Conf. Integer Programming and Combinatorial Optimization (LNCS 4513) (2007) (Springer-Verlag, Berlin/Heidelberg) 30–42Google Scholar
• Dey S. S., Richard J.-P. P. Relations between facets of low- and high-dimensional group problems. Math. Programming (2010) 123(2):285–313Crossref, Google Scholar
• Dey S. S., Wolsey L. A., Lodi A., Panconesi A., Rinaldi G. Lifting integer variables in minimal inequalities corresponding to lattice-free triangles. Proc. 13th Conf. Integer Programming and Combinatorial Optim. (2008) (Springer-Verlag, Berlin/Heidelberg) 463–475Google Scholar
• Dey S. S., Wolsey L. A. Constrained infinite group relaxations of MIPs. SIAM J. Optim. (2010) 20(6):2890–2912Crossref, Google Scholar
• Dey S. S., Wolsey L. A. Two row mixed integer cuts via lifting. Math. Programming (2010) 124(1–2):143–174Crossref, Google Scholar
• Espinoza D., Lodi A., Panconesi A., Rinaldi G. Computing with multi-row Gomory cuts. Proc. 13th Conf. Integer Programming and Combinatorial Optim. (2008) (Springer-Verlag, Berlin/Heidelberg) 214–224Google Scholar
• Fukasawa R., Günlük O. Strengthening lattice-free cuts using non-negativity. Discrete Optim. (2011) 8(2):229–245Crossref, Google Scholar
• Günlük O., Pochet Y. Mixing mixed-integer inequalities. Math. Programming (2001) 90(3):429–457Crossref, Google Scholar
• Li Y., Richard J.-P. P. Cook, Kannan and Schrijver's example revisited. Discrete Optim. (2008) 5(4):724–734Crossref, Google Scholar
• Nemhauser G. L., Wolsey L. A. A recursive procedure to generate all cuts for 0-1 mixed integer programs. Math. Programming (1990) 46(3):379–390Crossref, Google Scholar
• Rudin W.Principles of Mathematical Analysis (1976) (McGraw-Hill Book Company, New York) Google Scholar
• Vielma J. P. A constructive charaterization of the split closure of a mixed integer linear program. Oper. Res. Lett. (2007) 35(1):29–35Crossref, Google Scholar
• Zambelli G. On degenerate multi-row Gomory cuts. Oper. Res. Lett. (2009) 37(1):21–22Crossref, Google Scholar