Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms (Q1332349): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An on-line algorithm for multidimensional bin packing / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3988808 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A simple proof of Liang's lower bound for on-line bin packing and the extension to the parametric case / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A lower bound for on-line bin packing / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An improved lower bound for on-line bin packing algorithms / rank | |||
Normal rank | |||
Revision as of 16:45, 22 May 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
