Combining Lift-and-Project and Reduce-and-Split

References

• Achterberg T. SCIP: Solving constraint integer programs. Math. Programming Comput. (2009) 1(1):1–41Crossref, Google Scholar
• Achterberg T, Koch T, Martin A. MIPLIB 2003. Oper. Res. Lett. (2006) 34(4):361–372Crossref, Google Scholar
• Andersen K, Cornuéjols G, Li Y. Reduce-and-split cuts: Improving the performance of mixed-integer Gomory cuts. Management Sci. (2005a) 51(11):1720–1732Link, Google Scholar
• Andersen K, Cornuéjols G, Li Y. Split closure and intersection cuts. Math. Programming A (2005b) 102(3):457–493Crossref, Google 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, Bonami P. Generating lift-and-project cuts from the LP simplex tableau: Open source implementation and testing of new variants. Math. Programming Comput. (2009) 1(2–3):165–199Crossref, Google Scholar
• Balas E, Jeroslow RG. Stengthening cuts for mixed-integer programming. Eur. J. Oper. Res. (1980) 4(4):224–234Crossref, Google Scholar
• Balas E, Perregaard M. A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed-integer Gomory cuts for 0–1 programming. Math. Programming (2003) 94(2):221–245Crossref, Google Scholar
• Balas E, Ceria S, Cornuéjols G. A lift-and-project cutting plane algorithm for mixed 0–1 programming. Math. Programming (1993) 58(1–3):295–324Crossref, Google Scholar
• Balas E, Ceria S, Cornuéjols G. Mixed 0–1 programming by lift-and-project in a branch-and-cut framework. Management Sci. (1996a) 42(9):1229–1246Link, Google Scholar
• Balas E, Ceria S, Cornuéjols G, Natraj N. Gomory cuts revisited. Oper. Res. Lett. (1996b) 19(1):1–9Crossref, Google Scholar
• Bixby RE, Ceria S, McZeal CM, Savelsbergh MWP. An updated mixed-integer programming library: MIPLIB 3.0. Optima (1998) 58:12–15Google Scholar
• Ceria S, Cornuéjols G, Dawande M, Balas E, Clausen J. Combining and strengthening Gomory cuts. Integer Programming and Combinatorial Optimization (1995) (Springer, Berlin) 438–451Lecture Notes in Computer Science, Vol. 920Crossref, Google Scholar
• Cook W, Kannan R, Schrijver A. Chvátal closures for mixed-integer programming problems. Math. Programming (1990) 47(1–3):155–174Crossref, Google Scholar
• Cornuéjols G, Nannicini G. Practical strategies for generating rank-1 split cuts in mixed-integer linear programming. Math. Programming Comput. (2011) 3(4):281–318Crossref, Google Scholar
• Gomory RE. An algorithm for the mixed-integer problem. (1960) . Technical report RM-2597, RAND Corporation, Santa Monica, CAGoogle Scholar
• IBM ILOG IBM ILOG CPLEX 12.1 User's Manual. (2010) . IBM ILOG, Gentilly, FranceGoogle Scholar
• Margot F. Testing cut generators for mixed-integer linear programming. Math. Programming Comput. (2009) 1(1):69–95Crossref, Google Scholar
• Nemhauser GL, Wolsey L. A recursive procedure for generating all cuts for 0–1 mixed integer programs. Math. Programming (1990) 46(1–3):379–390Crossref, Google Scholar
• Perregaard M. A practical implementation of lift-and-project cuts. Internat. Sympos. Math. Programming (2003) CopenhagenGoogle Scholar
• Wesselmann F. Strengthening Gomory mixed-integer cuts: A computational study. (2009) . Technical report, University of Paderborn, Paderborn, GermanyGoogle Scholar