Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing
RAIRO-Oper. Res., 39 3 (2005) 163-183
Published online: 2006-01-25
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
1 (2025)
https://doi.org/10.1007/978-1-4614-6624-6_35-1
Comparing the costs of Any Fit algorithms for bin packing
Asaf LevinOperations Research Letters 50 (6) 646 (2022)
https://doi.org/10.1016/j.orl.2022.09.006
More on ordered open end bin packing
János Balogh, Leah Epstein and Asaf LevinJournal of Scheduling 24 (6) 589 (2021)
https://doi.org/10.1007/s10951-021-00709-3
Colored Bin Packing: Online Algorithms and Lower Bounds
Martin Böhm, György Dósa, Leah Epstein, Jiří Sgall and Pavel VeselýAlgorithmica 80 (1) 155 (2018)
https://doi.org/10.1007/s00453-016-0248-2
Algorithm Theory – SWAT 2014
György Dósa and Leah EpsteinLecture Notes in Computer Science, Algorithm Theory – SWAT 2014 8503 170 (2014)
https://doi.org/10.1007/978-3-319-08404-6_15
Bin packing with “Largest In Bottom” constraint: tighter bounds and generalizations
Gyorgy Dosa, Zsolt Tuza and Deshi YeJournal of Combinatorial Optimization 26 (3) 416 (2013)
https://doi.org/10.1007/s10878-011-9408-0
Handbook of Combinatorial Optimization
Edward G. Coffman, János Csirik, Gábor Galambos, Silvano Martello and Daniele VigoHandbook of Combinatorial Optimization 455 (2013)
https://doi.org/10.1007/978-1-4419-7997-1_35
On online bin packing with LIB constraints
Leah EpsteinNaval Research Logistics (NRL) 56 (8) 780 (2009)
https://doi.org/10.1002/nav.20383