Approximation algorithms for knapsack problems with cardinality constraints (Q1569936)
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 1471185
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for knapsack problems with cardinality constraints |
scientific article; zbMATH DE number 1471185 |
Statements
Approximation algorithms for knapsack problems with cardinality constraints (English)
0 references
9 July 2000
0 references
packing
0 references
approximation algorithms
0 references
dynamic programming
0 references
knapsack problem
0 references
0 references
0.94057214
0 references
0.93488765
0 references
0.9326602
0 references
0.93190825
0 references
0.93071836
0 references
0.9305234
0 references
0.92783576
0 references
0.9250108
0 references
0.92497075
0 references
