A complementary greedy heuristic for the knapsack problem (Q1203804): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
| Property / author | |||
| Property / author: Douglas J. White / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Joachim Piehler / rank | |||
Revision as of 08:16, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A complementary greedy heuristic for the knapsack problem |
scientific article |
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
