期刊
INFORMS JOURNAL ON COMPUTING
卷 15, 期 3, 页码 310-319出版社
INFORMS
DOI: 10.1287/ijoc.15.3.310.16082
关键词
cutting; packing; branch and bound; relaxations; algorithms
We consider the problem of orthogonally packing a given set of rectangular items into a given strip, by minimizing the overall height of the packing. The problem is NP-hard in the strong sense, and finds several applications in cutting and packing. We propose a new relaxation that produces good lower bounds and gives information to obtain effective heuristic algorithms. These results are used in a branch-and-bound algorithm, which was able to solve test instances from the literature involving up to 200 items.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据