Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms (Q1332349): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:54, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms |
scientific article |
Statements
Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms (English)
0 references
1 August 1995
0 references
suboptimal algorithms
0 references
asymptotic worst case ratio
0 references
1-dimensional bin packing
0 references
lower bounds
0 references
