A complementary greedy heuristic for the knapsack problem (Q1203804): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-2217(92)90179-d / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1963578197 / rank | |||
Normal rank | |||
Latest revision as of 08:56, 30 July 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
