Research on online bin packing model with item size no more than \(\frac{1}{2}\) (Q3132226)
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: Research on online bin packing model with item size no more than 12 |
scientific article; zbMATH DE number 6831637
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Research on online bin packing model with item size no more than \(\frac{1}{2}\) |
scientific article; zbMATH DE number 6831637 |
Statements
29 January 2018
0 references
bin packing
0 references
online algorithm
0 references
item size partition
0 references
asymptotic competitive ratio
0 references
0.8253200650215149
0 references
0.8196027278900146
0 references
0.806220531463623
0 references
0.8002740144729614
0 references
0.7977773547172546
0 references
