Upper and lower bounds for the complexity of the branch and bound method for the knapsack problem (Q3586262)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper and lower bounds for the complexity of the branch and bound method for the knapsack problem |
scientific article |
Statements
Upper and lower bounds for the complexity of the branch and bound method for the knapsack problem (English)
0 references
6 September 2010
0 references
subset sum problem
0 references
