Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem (Q1977259): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q224919 |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Dieter Jungnickel / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximation algorithms for the capacitated plant allocation problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3993418 / rank | |||
Normal rank | |||
Latest revision as of 14:59, 29 May 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
