A core-based exact algorithm for the multidimensional multiple choice knapsack problem
Year of publication: |
2020
|
---|---|
Authors: | Mansini, Renata ; Zanotti, Roberto |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 32.2020, 4, p. 1061-1079
|
Subject: | 0-1 knapsack problem | multiple choice knapsack problem | multidimensional knapsack problem | exact algorithm | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
-
Revisiting where are the hard knapsack problems? : via instance space analysis
Smith-Miles, Kate, (2021)
-
Weighted superposition attraction algorithm for binary optimization problems
Baykasoğlu, Adil, (2020)
-
A partheno-genetic algorithm for dynamic 0-1 multidimensional Knapsack problem
Ünal, Ali Nadi, (2016)
- More ...
-
A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem
Lamanna, Leonardo, (2022)
-
Optimizing the physician scheduling problem in a large hospital ward
Mansini, Renata, (2020)
-
The multi-visit team orienteering problem with precedence constraints
Hanafi, Saïd, (2020)
- More ...