A new exact approach for the 0-1 Collapsing Knapsack Problem
Year of publication: |
1 July 2017
|
---|---|
Authors: | Della Croce, Federico ; Salassa, Fabio ; Scatamacchia, Rosario |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 260.2017, 1 (1.7.), p. 56-69
|
Subject: | Branch and Bound | Collapsing Knapsack Problem | 0-1 Programming | Exact algorithm | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | Algorithmus | Algorithm | Branch-and-Bound |
-
Bin packing problem with time lags
Rivera Letelier, Orlando, (2022)
-
An empirical analysis of exact algorithms for the unbounded knapsack problem
Becker, Henrique, (2019)
-
Machine learning for combinatorial optimization : a methodological tour d'horizon
Bengio, Yoshua, (2021)
- More ...
-
An exact approach for the 0-1 knapsack problem with setups
Della Croce, Federico, (2017)
-
The longest processing time rule for identical parallel machines revisited
Della Croce, Federico, (2020)
-
Exact solution of the two-machine flow shop problem with three operations
Della Croce, Federico, (2022)
- More ...