An upper bound for the zero-one knapsack problem and a branch and bound algorithm (Q1245074)
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: An upper bound for the zero-one knapsack problem and a branch and bound algorithm |
scientific article; zbMATH DE number 3583589
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An upper bound for the zero-one knapsack problem and a branch and bound algorithm |
scientific article; zbMATH DE number 3583589 |
Statements
An upper bound for the zero-one knapsack problem and a branch and bound algorithm (English)
0 references
1977
0 references
