Upper and lower bounds for the complexity of the branch and bound method for the knapsack problem (Q3586262): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A Branch Search Algorithm for the Knapsack Problem / rank | |||
Normal rank | |||
Latest revision as of 03:30, 3 July 2024
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
