Reduce-and-Split Cuts: Improving the Performance of Mixed-Integer Gomory Cuts

References

• Andersen K., Cornuéjols G., Li Y. Split closure and intersection cuts. Math. Programming A (2005) 102:457–493Crossref, Google Scholar
• Balas E. Intersection cuts—A new type of cutting planes for integer programming. Oper. Res. (1971) 19:19–39Link, Google Scholar
• Balas E. Disjunctive programming. Ann. Discrete Math. (1979) 5:3–51Crossref, Google Scholar
• Balas E., Jeroslow R. G. Strengthening cuts for mixed integer programs. Eur. J. Oper. Res. (1980) 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 B (2003) 94:221–245Crossref, 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:1229–1246Link, Google Scholar
• Balas E., Ceria S., Cornuéjols G., Natraj N. R. Gomory cuts revisited. Oper. Res. Lett. (1996b) 19:1–9Crossref, Google Scholar
• Bixby R. E., Ceria S., McZeal C. M., Savelsbergh M. W. P. An updated mixed integer programming library: MIPLIB 3.0. Optima (1998) 58:12–15Google Scholar
• Bixby R. E., Gu Z., Rothberg E., Wunderling R., Grötschel M. The sharpest cut: The impact of Manfred Padberg and his work. MPS/SIAM Ser. Optim. (2004) 309–326Mixed integer programming: A progress reportGoogle Scholar
• Caprara A., Letchford A. On the separation of split cuts and related inequalities. Math. Programming (2003) 94:279–294Crossref, Google Scholar
• Ceria S., Cornuéjols G., Dawande M., Balas E., Clausen J. Combining and strengthening Gomory cuts. Integer Programming and Combinatorial Optimization (1995) 438–451LNCS, No. 920Crossref, Google Scholar
• Cook W., Kannan R., Schrijver A. Chvátal closures for mixed integer programs. Math. Programming (1990) 47:155–174Crossref, Google Scholar
• Cornuéjols G., Li Y. A connection between cutting plane theory and the geometry of numbers. Math. Programming (2002) 93:123–127Crossref, Google Scholar
• Cornuéjols G., Li Y., Vandenbussche D. K-cuts: A variation of Gomory mixed integer cuts from the LP tableau. INFORMS J. Comput. (2003) 15:385–396Link, Google Scholar
• ILOG (2002) . CPLEX optimizer version 8.0Google Scholar
• Crowder H., Johnson E., Padberg M. Solving large-scale zero-one linear programming problems. Oper. Res. (1983) 31:803–834Link, Google Scholar
• Eckstein J. E., Nediak M. Depth-optimized convexity cuts. (February 2003) . Technical report, RUTCOR, Rutgers University, Piscataway, NJGoogle Scholar
• Gomory R. E. An algorithm for the mixed integer problem. (1960) . Technical report RM-2597 The RAND Corporation, Santa Monica, CAGoogle Scholar
• Gomory R. E., Johnson E. L. T-space and cutting planes. Math. Programming B (2003) 96:341–375Crossref, Google Scholar
• Lenstra A. K., Lenstra H. W., Lovász L. Factoring polynomials with rational coefficients. Math. Ann. (1982) 261:515–534Crossref, Google Scholar
• Nemhauser G. L., Wolsey L. A. A recursive procedure for generating all cuts for 0-1 mixed integer programs. Math. Programming (1990) 46:379–390Crossref, Google Scholar