Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem (Q1977259): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:45, 1 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
