Cutting planes from the branch-and-bound tree : challenges and opportunities
Year of publication: |
2023
|
---|---|
Authors: | Contardo, Claudio ; Lodi, Andrea ; Tramontani, Andrea |
Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 35.2023, 1, p. 2-4
|
Subject: | branching tree | cutting planes | mixed-integer programming | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Operations Research | Operations research | Branch-and-Bound | Branch and Bound |
-
How important are branching decisions : fooling MIP solvers
Le Bodic, Pierre, (2015)
-
Wang, Guanglei, (2019)
-
Meier, Fabian, (2017)
- More ...
-
A time bucket formulation for the traveling salesman problem with time windows
Dash, Sanjeeb, (2012)
-
Multilevel approaches for the critical node problem
Baggio, Andrea, (2021)
-
On the practical strength of two-row tableau cuts
Dey, Santanu S., (2014)
- More ...