Bounded space on-line bin packing: Best is better than first (Q5946401)
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: Bounded space on-line bin packing: Best is better than first |
scientific article; zbMATH DE number 1658798
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounded space on-line bin packing: Best is better than first |
scientific article; zbMATH DE number 1658798 |
Statements
Bounded space on-line bin packing: Best is better than first (English)
0 references
4 March 2002
0 references
on-line bin packing algorithms
0 references
\(K\)-bounded best fit algorithms
0 references
