A Fully Polynomial Approximation Scheme for a Knapsack Problem with a Minimum Filling Constraint (Q5199285)
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: A Fully Polynomial Approximation Scheme for a Knapsack Problem with a Minimum Filling Constraint |
scientific article; zbMATH DE number 5938317
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Fully Polynomial Approximation Scheme for a Knapsack Problem with a Minimum Filling Constraint |
scientific article; zbMATH DE number 5938317 |
Statements
A Fully Polynomial Approximation Scheme for a Knapsack Problem with a Minimum Filling Constraint (English)
0 references
12 August 2011
0 references
approximation algorithm
0 references
FPTAS
0 references
knapsack problem
0 references
minimum filling constraint
0 references
