Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem (Q1977259): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q224919 |
||
| Property / author | |||
| Property / author: Dieter Jungnickel / rank | |||
Revision as of 07:09, 11 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem |
scientific article |
Statements
Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem (English)
0 references
30 October 2000
0 references
0/1 knapsack problem
0 references
subset-sum problem
0 references
approximation
0 references
greedy algorithms
0 references
