On Online Algorithms for Bin, Strip, and Box Packing, and Their Worst-Case and Average-Case Analysis


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

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.

作者简介

D. Lazarev

Ivannikov Institute for System Programming, Russian Academy of Sciences; Moscow Institute of Physics and Technology

编辑信件的主要联系方式.
Email: dennis810@mail.ru
俄罗斯联邦, ul. Solzhenitsyna 25, Moscow, 109004; Institutskii per. 9, Dolgoprudnyi, Moscow oblast, 141700

N. Kuzyurin

Ivannikov Institute for System Programming, Russian Academy of Sciences; Moscow Institute of Physics and Technology

编辑信件的主要联系方式.
Email: nnkuz@ispras.ru
俄罗斯联邦, ul. Solzhenitsyna 25, Moscow, 109004; Institutskii per. 9, Dolgoprudnyi, Moscow oblast, 141700

补充文件

附件文件
动作
1. JATS XML

版权所有 © Pleiades Publishing, Ltd., 2019