Abstract

In this survey, we consider online algorithms for bin packing and strip packing problems, as well as their generalizations (multidimensional bin packing, multiple strip packing, and packing into strips of different widths). For the latter problem, only the worst-case analysis is described; for the other problems, both the worst-case and average-case (probabilistic) asymptotic ratios are presented. The best lower and upper bounds are considered. Basic algorithms and methods for their analysis are discussed.

中文翻译：

---

装箱，装箱和装箱的在线算法及其最坏情况和平均情况分析

摘要

在本次调查中，我们考虑了有关装箱和条带包装问题的在线算法，以及它们的概括（多维装箱，多条装箱和包装成不同宽度的条带）。对于后一个问题，仅描述最坏情况的分析。对于其他问题，同时给出了最坏情况和平均情况（概率）渐近比率。最好考虑下限和上限。讨论了用于其分析的基本算法和方法。