Email this article On Online Algorithms for Bin, Strip, and Box Packing, and Their Worst-Case and Average-Case Analysis
- Authors: Lazarev D.O.1,2, Kuzyurin N.N.1,2
-
Affiliations:
- Ivannikov Institute for System Programming, Russian Academy of Sciences
- Moscow Institute of Physics and Technology
- Issue: Vol 45, No 8 (2019)
- Pages: 448-457
- Section: Article
- URL: https://journal-vniispk.ru/0361-7688/article/view/176974
- DOI: https://doi.org/10.1134/S0361768819080036
- ID: 176974
Cite item
Open Access
Access granted
Subscription Access
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.
About the authors
D. O. Lazarev
Ivannikov Institute for System Programming, Russian Academy of Sciences; Moscow Institute of Physics and Technology
Author for correspondence.
Email: dennis810@mail.ru
Russian Federation, ul. Solzhenitsyna 25, Moscow, 109004; Institutskii per. 9, Dolgoprudnyi, Moscow oblast, 141700
N. N. Kuzyurin
Ivannikov Institute for System Programming, Russian Academy of Sciences; Moscow Institute of Physics and Technology
Author for correspondence.
Email: nnkuz@ispras.ru
Russian Federation, ul. Solzhenitsyna 25, Moscow, 109004; Institutskii per. 9, Dolgoprudnyi, Moscow oblast, 141700
Supplementary files
