A note on a variant of the online open end bin packing problem
Year of publication: |
2020
|
---|---|
Authors: | Epstein, Leah ; Levin, Asaf |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 48.2020, 6, p. 844-849
|
Subject: | Bin packing | Competitive analysis | Asymptotic competitive ratio | Worst-case analysis |
-
Semi-on-line bin packing : a short overview and a new lower bound
Balogh, János, (2013)
-
Approximation algorithms for a new truck loading problem in urban freight transportation
Fan, Jie, (2020)
-
Comparing the costs of any fit algorithms for bin packing
Levin, Asaf, (2022)
- More ...
-
Scheduling with processing set restrictions: PTAS results for several variants
Epstein, Leah, (2011)
-
Epstein, Leah, (2016)
-
Boyar, Joan, (2018)
- More ...