A hybrid algorithm for the unbounded knapsack problem (Q1013302)
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 hybrid algorithm for the unbounded knapsack problem |
scientific article; zbMATH DE number 5544692
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A hybrid algorithm for the unbounded knapsack problem |
scientific article; zbMATH DE number 5544692 |
Statements
A hybrid algorithm for the unbounded knapsack problem (English)
0 references
17 April 2009
0 references
branch and bound
0 references
dynamic programming
0 references
algorithm engineering
0 references
0 references
0.8300247192382812
0 references
0.8151707053184509
0 references
0.8065527081489563
0 references
0.8036291599273682
0 references
