A bound and bound algorithm for the zero-one multiple knapsack problem (Q1155514)
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: A bound and bound algorithm for the zero-one multiple knapsack problem |
scientific article; zbMATH DE number 3731749
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A bound and bound algorithm for the zero-one multiple knapsack problem |
scientific article; zbMATH DE number 3731749 |
Statements
A bound and bound algorithm for the zero-one multiple knapsack problem (English)
0 references
1981
0 references
bound and bound algorithm
0 references
zero-one multiple knapsack problem
0 references
tree- search technique
0 references
computational results
0 references
integer linear programming
0 references
