当前位置:
X-MOL 学术
›
Program. Comput. Softw.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
On Online Algorithms for Bin, Strip, and Box Packing, and Their Worst-Case and Average-Case Analysis
Programming and Computer Software ( IF 0.7 ) Pub Date : 2020-01-14 , DOI: 10.1134/s0361768819080036 D. O. Lazarev , N. N. Kuzyurin
中文翻译:
装箱,装箱和装箱的在线算法及其最坏情况和平均情况分析
更新日期:2020-01-14
Programming and Computer Software ( IF 0.7 ) Pub Date : 2020-01-14 , DOI: 10.1134/s0361768819080036 D. O. Lazarev , N. N. Kuzyurin
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.中文翻译:
装箱,装箱和装箱的在线算法及其最坏情况和平均情况分析