Comparing the costs of any fit algorithms for bin packing
Year of publication: |
2022
|
---|---|
Authors: | Levin, Asaf |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 50.2022, 6, p. 646-649
|
Subject: | Bin packing | Online algorithms | Worst-case analysis | Analysis of algorithms | Theorie | Theory | Algorithmus | Algorithm | Packproblem | Packing problem |
-
Boyar, Joan, (2018)
-
Online algorithms for 1-space bounded multi dimensional bin packing and hypercube packing
Zhang, Yong, (2013)
-
More on ordered open end bin packing
Balogh, János, (2021)
- More ...
-
Methodologies and Algorithms for Group-Rankings Decision
Hochbaum, Dorit S., (2006)
-
Scheduling with processing set restrictions: PTAS results for several variants
Epstein, Leah, (2011)
-
Lexicographic local search and the p-center problem
Hassin, Refael, (2003)
- More ...