Yet harder knapsack problems (Q653327)
From MaRDI portal
!
WARNING
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 5995827
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Yet harder knapsack problems |
scientific article; zbMATH DE number 5995827 |
Statements
Yet harder knapsack problems (English)
0 references
9 January 2012
0 references
branch and bound
0 references
dynamic programming
0 references
memoization
0 references
branching program
0 references
knapsack
0 references
perfect matching
0 references
0.8480554223060608
0 references
0.8447661995887756
0 references
0.8150365352630615
0 references
