Average performance of greedy heuristics for the integer knapsack problem. (Q1420409)
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 2035746
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Average performance of greedy heuristics for the integer knapsack problem. |
scientific article; zbMATH DE number 2035746 |
Statements
Average performance of greedy heuristics for the integer knapsack problem. (English)
0 references
2 February 2004
0 references
Heuristics
0 references
Combinatorial optimization
0 references
Integer programming
0 references
Knapsack
0 references
Probabilistic algorithm
0 references
0 references
0 references
0.923117220401764
0 references
0.8754640817642212
0 references
0.8729861378669739
0 references
0.8481252789497375
0 references
0.8457910418510437
0 references
