Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm (Q4966750): Difference between revisions
From MaRDI portal
Latest revision as of 17:05, 19 July 2024
scientific article; zbMATH DE number 7074287
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm |
scientific article; zbMATH DE number 7074287 |
Statements
Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm (English)
0 references
27 June 2019
0 references
knapsack integer problem
0 references
reformulation
0 references
branch and bound
0 references
computational complexity
0 references
0 references
