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 | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming | Filiale | Branch office |
-
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 ...
-
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)
-
The continuous-time service network design problem
Boland, Natashia, (2017)
- More ...