An asymptotic fully polynomial time approximation scheme for bin covering. (Q1426473)
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: An asymptotic fully polynomial time approximation scheme for bin covering. |
scientific article; zbMATH DE number 2056815
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An asymptotic fully polynomial time approximation scheme for bin covering. |
scientific article; zbMATH DE number 2056815 |
Statements
An asymptotic fully polynomial time approximation scheme for bin covering. (English)
0 references
14 March 2004
0 references
Asymptotic approximation scheme
0 references
Bin covering
0 references
Linear programming
0 references
