A total-value greedy heuristic for the integer knapsack problem (Q1200766)
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 95774
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A total-value greedy heuristic for the integer knapsack problem |
scientific article; zbMATH DE number 95774 |
Statements
A total-value greedy heuristic for the integer knapsack problem (English)
0 references
16 January 1993
0 references
approximation algorithms
0 references
worst-case performance
0 references
greedy heuristic
0 references
integer knapsack
0 references
density-ordered greedy heuristic
0 references
0.923117220401764
0 references
0.8993614912033081
0 references
0.87330561876297
0 references
0.8719314932823181
0 references
