A New and Improved Algorithm for Online Bin Packing
We revisit the classic online bin packing problem studied in the half-century. In this problem, items of positive sizes no larger than 1 are presented one by one to be packed into subsets called bins of total sizes no larger than 1, such that every item is assigned to a bin before the next item is p...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Könyv része |
| Megjelent: |
Leibniz-Zentrum für Informatik
Schloss Dagstuhl
2018
|
| Sorozat: | 26th Annual European Symposium on Algorithms (ESA 2018)
|
| Tárgyszavak: | |
| doi: | 10.4230/LIPIcs.ESA.2018.5 |
| mtmt: | 3407860 |
| Online Access: | http://publicatio.bibl.u-szeged.hu/28447 |
Hasonló tételek
Bounded space on-line variable-sized bin packing
Szerző: Burkard Rainer E., et al.
Megjelent: (1997)
Szerző: Burkard Rainer E., et al.
Megjelent: (1997)