We improve the lower bound on the asymptotic competitive ratio of any online algorithm for bin packing to above 1.54278. We demonstrate for the first time the advantage of branching and the applicability of full adaptivity in the design of lower bounds for the classic online bin packing problem. We apply a new method for weight based analysis, which is usually applied only in proofs of upper bounds. The values of previous lower bounds were approximately 1.5401 and 1.5403.

中文翻译：

---

经典在线装箱的新下界

我们将任何用于装箱的在线算法的渐近竞争比的下限提高到1.54278以上。我们首次展示了分支的优势以及完全适应性在经典在线垃圾箱包装问题下限设计中的适用性。我们为基于权重的分析应用了一种新方法，该方法通常仅适用于上限证明。先前下限的值大约为1.5401和1.5403。