A New Algorithm for the 0-1 Knapsack Problem (Q3789335)
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 4053346
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A New Algorithm for the 0-1 Knapsack Problem |
scientific article; zbMATH DE number 4053346 |
Statements
A New Algorithm for the 0-1 Knapsack Problem (English)
0 references
1988
0 references
0-1 knapsack problem
0 references
large-size problems
0 references
heuristic
0 references
branch-and-bound
0 references
0.8797664046287537
0 references
0.870389461517334
0 references
0.870389461517334
0 references
0.8566186428070068
0 references
