Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem (Q3116647)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem |
scientific article |
Statements
Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem (English)
0 references
12 February 2012
0 references
knapsack problem
0 references
dynamic programming
0 references
branch-and-bound
0 references
surrogate relaxation
0 references
