The average quality of greedy-algorithms for the Subset-Sum-Maximization Problem (Q3354469)
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: The average quality of greedy-algorithms for the Subset-Sum-Maximization Problem |
scientific article; zbMATH DE number 4207221
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The average quality of greedy-algorithms for the Subset-Sum-Maximization Problem |
scientific article; zbMATH DE number 4207221 |
Statements
The average quality of greedy-algorithms for the Subset-Sum-Maximization Problem (English)
0 references
1991
0 references
greedy-algorithms
0 references
knapsack problems
0 references
stochastic analysis of heuristic algorithms
0 references
subset sum maximization
0 references
0 references
0.9076491594314576
0 references
0.9068934321403505
0 references
0.8033566474914551
0 references
0.803059995174408
0 references
0.7951952815055847
0 references
