A complementary greedy heuristic for the knapsack problem (Q1203804)
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 123549
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A complementary greedy heuristic for the knapsack problem |
scientific article; zbMATH DE number 123549 |
Statements
A complementary greedy heuristic for the knapsack problem (English)
0 references
18 February 1993
0 references
Some structural properties but no computational results of a new \(O(n^ 2)\)-heuristic for the usual knapsack problem are given. There are some connections to the well-known greedy heuristic but these cannot be discussed here.
0 references
knapsack problem
0 references
greedy heuristic
0 references
0.94783723
0 references
0.9319711
0 references
0.9045323
0 references
0.89917016
0 references
0.89796174
0 references
0.8978799
0 references
0.8968788
0 references
0.89677745
0 references
