Online bin packing problem with buffer and bounded size revisited (Q511697)
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: Online bin packing problem with buffer and bounded size revisited |
scientific article; zbMATH DE number 6687847
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Online bin packing problem with buffer and bounded size revisited |
scientific article; zbMATH DE number 6687847 |
Statements
Online bin packing problem with buffer and bounded size revisited (English)
0 references
22 February 2017
0 references
bin packing
0 references
online algorithm
0 references
asymptotic competitive ratio
0 references
0.8450418710708618
0 references
0.8324231505393982
0 references
0.8280299305915833
0 references
0.8253200650215149
0 references
