An improvement of previously known upper bound of Multiple Strip Packing problem and probabilistic analysis of algorithm in case of large number of strips given
In this article, an analog of previously proposed algorithm Limited Hash Packing for Multiple Strip Packing Problem is studied using probabilistic analysis. Limited Hash Packing is an on-line algorithm, which works in closed-end mode, knowing the number of rectangles it has to pack before knowing...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Ivannikov Institute for System Programming of the Russian Academy of Sciences
2019-04-01
|
| Series: | Труды Института системного программирования РАН |
| Subjects: | |
| Online Access: | https://ispranproceedings.elpub.ru/jour/article/view/1142 |