A simple 0.5-bounded greedy algorithm for the 0/1 knapsack problem (Q1198054): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:30, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple 0.5-bounded greedy algorithm for the 0/1 knapsack problem |
scientific article |
Statements
A simple 0.5-bounded greedy algorithm for the 0/1 knapsack problem (English)
0 references
16 January 1993
0 references
approximation algorithm
0 references
Non-Increasing First Fit greedy algorithm
0 references
\(0/1\) knapsack problem
0 references
