当前位置: X-MOL 学术J. Comb. Optim. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Lower bounds for batched bin packing
Journal of Combinatorial Optimization ( IF 0.9 ) Pub Date : 2021-08-23 , DOI: 10.1007/s10878-021-00797-z
János Balogh 1 , József Békési 1 , György Dósa 2 , Leah Epstein 3 , Asaf Levin 4
Affiliation  

We consider batched bin packing. Items are presented in a constant number of batches, and each batch should be packed before the next batch is presented. The cases of two, three, and four batches are studied. We prove improved lower bounds for the standard and parametric variants in some of the cases, and shorten the proofs for all other cases. To achieve this, we apply a new technique in our analysis, which differs from the ones previously used for proving such results.



中文翻译:

分批装箱的下限

我们考虑分批装箱。物品以固定数量的批次展示,每批应在展示下一批之前进行包装。分别研究了二批、三批、四批的情况。我们在某些情况下证明了标准和参数变体的改进下界,并缩短了所有其他情况的证明。为了实现这一点,我们在分析中应用了一种新技术,该技术不同于之前用于证明此类结果的技术。

更新日期:2021-08-24
down
wechat
bug