When Lift-and-Project Cuts Are Different

References

• Achterberg T, Koch T, Martin A (2006) MIPLIB 2003. Oper. Res. Lett. 34(4):361–372.Crossref, Google Scholar
• Andersen K, Cornuéjols G, Li Y (2005) Split closure and intersection cuts. Math. Programming 102(3):457–493.Crossref, Google Scholar
• Andersen K, Louveaux Q, Weismantel R, Wolsey LA (2007) Inequalities from two rows of a simplex tableau. Fischetti M, Williamson DP, eds. Integer Programming and Combinatorial Optimization (IPCO 2007), Lecture Notes in Computer Science, vol. 4513 (Springer, Berlin, Heidelberg), 1–15.Crossref, Google Scholar
• Balas E (1971) Intersection cuts—A new type of cutting planes for integer programming. Oper. Res. 19(1):19–39.Link, Google Scholar
• Balas E (1979) Disjunctive programming. Annals Discrete Math. 5:3–51.Google Scholar
• Balas E (1998) Disjunctive programming: Properties of the convex hull of feasible points. Discrete Appl. Math. 89(1–3):3–44.Crossref, Google Scholar
• Balas E, Bonami P (2009) Generating lift-and-project cuts from the LP simplex tableau: Open source implementation and testing of new variants. Math. Programming Comput. 1(2–3):165–199.Crossref, Google Scholar
• Balas E, Jeroslow RG (1980) Strengthening cuts for mixed integer programs. Eur. J. Oper. Res. 4(4):224–234.Crossref, Google Scholar
• Balas E, Kis T (2016) On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts. Math. Programming 160(1–2):85–114.Crossref, Google Scholar
• Balas E, Perregaard M (2003) A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer Gomory cuts for 0–1 programming. Math. Programming Ser. B. 94(2–3):221–245.Google Scholar
• Balas E, Qualizza A (2013) Intersection cuts from multiple rows: A disjunctive programming approach. EURO J. Comput. Optim. 1(1–2):3–49.Crossref, Google Scholar
• Balas E, Ceria S, Cornuéjols G (1993) A lift-and-project cutting plane algorithm for mixed 0–1 programs. Math. Programming 58(1):295–324.Crossref, Google Scholar
• Balas E, Ceria S, Cornuéjols G (1996) Mixed 0–1 programming by lift-and-project in a branch-and-cut framework. Management Sci. 42(9):1229–1246.Link, Google Scholar
• Basu A, Conforti M, Di Summa M (2015) A geometric approach to cut-generating functions. Math. Programming 151(1):153–189.Crossref, Google Scholar
• Basu A, Bonami P, Cornuéjols G, Margot F (2011) Experiments with two-row cuts from degenerate tableaux. INFORMS J. Comput. 23(4):578–590.Link, Google Scholar
• Basu A, Conforti M, Cornuéjols G, Zambelli G (2010) Maximal lattice-free convex sets in linear subspaces. Math. Oper. Res. 35(3):704–720.Link, Google Scholar
• Basu A, Campêlo M, Conforti M, Cornuéjols G, Zambelli G (2013) Unique lifting of integer variables in minimal inequalities. Math. Programming 141(1):561–576.Crossref, Google Scholar
• Bixby RE, Boyd EA, Indovina RR (1992) MIPLIB: A test set of mixed integer programming problems. SIAM News 25:16.Google Scholar
• Bixby RE, Ceria S, McZeal CM, Savelsbergh MWP (1998) An updated mixed integer programming library: MIPLIB 3.0. Optima 58:12–15.Google Scholar
• Borozan V, Cornuéjols G (2009) Minimal valid inequalities for integer constraints. Math. Oper. Res. 34(3):538–546.Link, Google Scholar
• Conforti M, Cornuéjols G, Zambelli G (2011a) Corner polyhedron and intersection cuts. Surveys Oper. Res. Management Sci. 16(2):105–120.Crossref, Google Scholar
• Conforti M, Cornuéjols G, Zambelli G (2011b) A geometric perspective on lifting. Oper. Res. 59(3):569–577.Link, Google Scholar
• Cornuéjols G, Margot F (2008) On the facets of mixed integer programs with two integer variables and two constraints. Math. Programming 120(2):429–456.Crossref, Google Scholar
• Dash S, Dey SS, Günlük O (2012) Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra. Math. Programming 135(1):221–254.Crossref, Google Scholar
• Dash S, Günlük O, Vielma JP (2014) Computational experiments with cross and crooked cross cuts. INFORMS J. Comput. 26(4):780–797.Link, Google Scholar
• Dey SS, Wolsey LA (2010) Two row mixed-integer cuts via lifting. Math. Programming 124(1):143–174.Crossref, Google Scholar
• Dey SS, Lodi A, Tramontani A, Wolsey LA (2014) On the practical strength of two-row tableau cuts. INFORMS J. Comput. 26(2):222–237.Link, Google Scholar
• Espinoza DG (2008) Computing with multi-row Gomory cuts. Lodi A, Panconesi A, Rinaldi G, eds. Integer Programming and Combinatorial Optimization (Springer, Berlin, Heidelberg), 214–224.Crossref, Google Scholar
• Fukasawa R, Poirrier L, Xavier AS (2016) The (not so) trivial lifting in two dimensions. Technical report, University of Waterloo, Waterloo, Ontario, Canada.Google Scholar
• Gomory RE (1960) An algorithm for the mixed integer problem. Technical report, The Rand Corporation, Santa Monica, CA.Google Scholar
• Kis T (2014) Lift-and-project for general two-term disjunctions. Discrete Optim. 12:98–114.Crossref, Google Scholar
• Li Y, Richard JPP (2008) Cook, Kannan and Schrijver’s example revisited. Discrete Optim. 5(4):724–734.Crossref, Google Scholar
• Louveaux Q, Poirrier L, Salvagnin D (2015) The strength of multi-row models. Math. Programming Comput. 7(2):113–148.Crossref, Google Scholar