A complementary greedy heuristic for the knapsack problem (Q1203804): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3214706 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4178782 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Linear Programming Approach to the Cutting Stock Problem—Part II / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The knapsack problem: A survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5753755 / rank | |||
Normal rank | |||
Revision as of 13:43, 17 May 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
