Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem (Q3116647)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem |
scientific article; zbMATH DE number 6005759
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem |
scientific article; zbMATH DE number 6005759 |
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
0.92205775
0 references
0.91556484
0 references
0.9097025
0 references
0.9078618
0 references
0 references
0 references
0 references
