Cutting Planes from the Branch-and-Bound Tree: Challenges and Opportunities

References

• Achterberg T (2007) Constraint integer programming. PhD thesis, ZIB, Berlin.Google Scholar
• Berthold T, Francobaldi M, Hendel G (2022) Learning to use local cuts. Preprint, submitted June 23, https://arxiv.org/abs/2206.11618.Google Scholar
• Chételat D, Lodi A (2022) Continuous cutting plane algorithms in integer programming. Preprint, submitted April 19, https://arxiv.org/abs/2204.09122.Google Scholar
• Cornuéjols G (2008) Valid inequalities for mixed integer linear programs. Math. Programming 112:3–44.Crossref, Google Scholar
• Dey SS, Molinaro M (2018) Theoretical challenges toward cutting-plane selection. Math. Programming 170:237–266.Crossref, Google Scholar
• Fischetti M, Salvagnin D (2010) A relax-and-cut framework for Gomory’s mixed-integer cuts. Math. Programming Comput. 3:123–135.Google Scholar
• Gomory RE (1958) Outline of an algorithm for integer solutions to linear programs. Bull. Amer. Math. Soc. (New Series) 64:275–278.Crossref, Google Scholar
• Gomory RE (1960) An algorithm for the mixed integer problem. Technical report RM-2597, The Rand Corporation, Santa Monica, CA.Google Scholar
• Kazachkov AM (2018) Non-recursive cut generation. PhD thesis, Carnegie Mellon University, Pittsburgh, PA.Google Scholar
• Klotz E, Newman AM (2013) Practical guidelines for solving difficult linear programs. Survey Oper. Res. Management Sci. 18:1–17.Crossref, Google Scholar
• Koch T, Achterberg T, Andersen E, Bastert O, Berthold T, Bixby RE, Danna E, et al. (2011) MIPLIB 2010. Math. Programming Comput. 3(2):103–163.Crossref, Google Scholar
• Land AH, Doig AG (1960) An automatic method of solving discrete programming problems. Econometrica 28:497–520.Crossref, Google Scholar
• Lodi A (2010) Mixed integer programming computation. 50 Years of Integer Programming 1958-2008 (Springer, Berlin), 619–645.Crossref, Google Scholar
• Marchand H, Wolsey LA (2001) Aggregation and mixed integer rounding to solve MIPS. Oper. Res. 49(3):363–371.Link, Google Scholar
• Padberg MW, Rinaldi G (1991) A branch and cut algorithm for the resolution of large-scale symmetric traveling salesmen problems. SIAM Rev. 33:60–100.Crossref, Google Scholar