Bounded space on-line bin packing: Best is better than first (Q5946401): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00453-001-0041-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3137260489 / rank | |||
Normal rank | |||
Revision as of 21:41, 19 March 2024
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
