New trends in exact algorithms for the \(0-1\) knapsack problem (Q1569935)
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 1471184
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New trends in exact algorithms for the \(0-1\) knapsack problem |
scientific article; zbMATH DE number 1471184 |
Statements
New trends in exact algorithms for the \(0-1\) knapsack problem (English)
0 references
9 July 2000
0 references
knapsack problem
0 references
branch-and-bound
0 references
dynamic programming
0 references
state-of-the-art
0 references
0 references
0.8813589215278625
0 references
0.8605736494064331
0 references
0.8565091490745544
0 references
0.8431103229522705
0 references
0.8431103229522705
0 references
