Cutting Planes from the Branch-and-Bound Tree: Challenges and Opportunities
Published Online:15 Nov 2022https://doi.org/10.1287/ijoc.2022.1248
- Cited by
- 14 May 2025 | Mathematical Programming, Vol. 215, No. 1-2
- Towards an unsupervised learning scheme for efficiently solving parameterized mixed-integer programsComputers & Operations Research, Vol. 185
- 24 February 2026 | Journal of Computer and Systems Sciences International, Vol. 64, No. 6
- Applied Soft Computing, Vol. 182
- European Journal of Operational Research, Vol. 324, No. 3
- Applied Soft Computing, Vol. 174
- Expert Systems with Applications, Vol. 234
Volume 35, Issue 1
January-February 2023
Pages 1-264, C2
Article Information
Metrics
Information
- Received:May 16, 2022
- Accepted:August 25, 2022
- Published Online:November 15, 2022
Copyright © 2022, INFORMS
Cite as
Claudio Contardo, Andrea Lodi, Andrea Tramontani (2022) Cutting Planes from the Branch-and-Bound Tree: Challenges and Opportunities. INFORMS Journal on Computing 35(1):2-4.
https://doi.org/10.1287/ijoc.2022.1248
Keywords
The authors thank Matteo Fischetti, Jeff Linderoth, and Oktay Günlük for interesting conversations about the topic and two anonymous referees for suggesting some useful improvements to the original version of the paper.
