Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems
Year of publication: |
2022
|
---|---|
Authors: | Yang, Yu ; Boland, Natashia ; Dilkina, Bistra ; Savelsbergh, Martin W. P. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 301.2022, 3 (16.9.), p. 828-840
|
Subject: | Branch and bound | Machine learning | Binary optimization | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Lernprozess | Learning process | Ganzzahlige Optimierung | Integer programming | Branch-and-Bound | Branch and Bound |
-
Neto, Teresa, (2013)
-
A branch and bound algorithm for a class of biobjective mixed integer programs
Stidsen, Thomas, (2014)
-
An empirical analysis of exact algorithms for the unbounded knapsack problem
Becker, Henrique, (2019)
- More ...
-
Multivariable branching : a 0-1 knapsack problem case study
Yang, Yu, (2021)
-
Substitution-based equipment balancing in service networks with multiple equipment types
Yang, Yu, (2022)
-
The continuous-time service network design problem
Boland, Natashia, (2017)
- More ...