Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6895905 | European Journal of Operational Research | 2016 | 6 Pages |
Abstract
In this paper, we consider the online strip packing problem, in which a list of online rectangles has to be packed without overlap or rotation into a strip of width 1 and infinite length so as to minimize the required height of the packing. We derive a new improved lower bound of (3+5)/2â2.618 for the competitive ratio for this problem. This result improves the best known lower bound of 2.589.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Guosong Yu, Yanling Mao, Jiaoliao Xiao,