Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem (Q1977259)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem |
scientific article; zbMATH DE number 1444231
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem |
scientific article; zbMATH DE number 1444231 |
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
