A comprehensive empirical demonstration of the impact of choice constraints on solving generalizations of the 0–1 knapsack problem using the integer programming option of CPLEX<sup>®</sup> (Q5059432)
From MaRDI portal
scientific article; zbMATH DE number 7637184
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A comprehensive empirical demonstration of the impact of choice constraints on solving generalizations of the 0–1 knapsack problem using the integer programming option of CPLEX<sup>®</sup> |
scientific article; zbMATH DE number 7637184 |
Statements
A comprehensive empirical demonstration of the impact of choice constraints on solving generalizations of the 0–1 knapsack problem using the integer programming option of CPLEX<sup>®</sup> (English)
0 references
23 December 2022
0 references
multidimensional knapsack problem
0 references
multiple-choice multidimensional knapsack problem
0 references
multi-demand multidimensional knapsack problem
0 references
multi-demand multiple-choice multidimensional knapsack problem
0 references
CPLEX\(^{\circledR}\) integer programming option
0 references
0 references
0 references
