An asymptotic fully polynomial time approximation scheme for bin covering. (Q1426473): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On a dual version of the one-dimensional bin packing problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2707233 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2768348 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Coordination Complexity of Parallel Price-Directive Decomposition / rank | |||
Normal rank | |||
Latest revision as of 15:54, 6 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An asymptotic fully polynomial time approximation scheme for bin covering. |
scientific article |
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
