科研之友
微信
新浪微博
Facebook
分享链接
摘要
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 + root 5)/2 approximate to 2.618 for the competitive ratio for this problem. This result improves the best known lower bound of 2.589.
- 出版日期2016-5-1
- 单位南昌大学
