Algorithm 632: A program for the 0–1 multiple knapsack problem (Q3675904)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3896664
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithm 632: A program for the 0–1 multiple knapsack problem |
scientific article; zbMATH DE number 3896664 |
Statements
Algorithm 632: A program for the 0–1 multiple knapsack problem (English)
0 references
1985
0 references
branch and bound
0 references
0-1 multiple knapsack problem
0 references
depth-first tree-search technique
0 references
0.7924010157585144
0 references
0.7896059155464172
0 references
0.7817660570144653
0 references