|
|||||
|
|
A new upper bound for the online square packing problem in a strip |
|
| Authors: | Guosong Yu Yanling Mao Jiaoliao Xiao |
| Affiliation: | 1.Department of Mathematics,Nanchang University,Nanchang,People’s Republic of China;2.Numerical Simulation and High-Performance Computing Laboratory,Nanchang University,Nanchang,People’s Republic of China;3.Department of Management Science and Engineering,Nanchang University,Nanchang,People’s Republic of China |
| Abstract: | In this paper we consider the online problem of packing a list of squares into one strip of width 1 and infinite length without overlap so as to minimize the required height of the packing. We derive an upper bound 5 on the competitive ratio for this problem. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |