Multivariable branching : a 0-1 knapsack problem case study
| Year of publication: |
2021
|
|---|---|
| Authors: | Yang, Yu ; Boland, Natashia ; Savelsbergh, Martin W. P. |
| Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 33.2021, 4, p. 1354-1367
|
| Subject: | 0-1 knapsack problem | branch and bound | branching scheme | multivariable branching | Theorie | Theory | Branch-and-Bound | Branch and Bound | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | Operations Research | Operations research |
-
Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems
Yang, Yu, (2022)
-
Meier, Fabian, (2017)
-
Wang, Guanglei, (2019)
- More ...
-
Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems
Yang, Yu, (2022)
-
Substitution-based equipment balancing in service networks with multiple equipment types
Yang, Yu, (2022)
-
Preprocessing and cut generation techniques for multi-objective binary programming
Boland, Natashia, (2019)
- More ...