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

Claudio Contardo (), Andrea Lodi () and Andrea Tramontani ()
Additional contact information
Claudio Contardo: IBM Canada Laboratory, Toronto, Ontario L6G 1C7, Canada
Andrea Lodi: Jacobs Technion-Cornell Institute, Cornell Tech and Technion, Israel Institute of Technology, New York, New York 10044
Andrea Tramontani: FICO Xpress Optimization, FICO Italy, Milan 20123, Italy

INFORMS Journal on Computing, 2023, vol. 35, issue 1, 2-4

Abstract: In this short paper, we argue that the standard approach adopted by modern mixed-integer linear programming solvers of using very little cutting plane generation in the branch-and-bound tree can be too conservative and lead to the loss of significant opportunities. Our observation is motivated by some relatively simple computational investigation on a couple of instances in the MIPlib 2010 collection for which the benefit of generating globally valid cuts in the tree is significant.

Keywords: cutting planes; branching tree; mixed-integer programming (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/ijoc.2022.1248 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:orijoc:v:35:y:2023:i:1:p:2-4

Access Statistics for this article

More articles in INFORMS Journal on Computing from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().