Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms (Q1332349): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02246509 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1580752931 / rank | |||
Normal rank | |||
Latest revision as of 10:58, 30 July 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
0 references
