4.1 Article

A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem

期刊

DISCRETE OPTIMIZATION
卷 6, 期 2, 页码 174-188

出版社

ELSEVIER SCIENCE BV
DOI: 10.1016/j.disopt.2008.11.002

关键词

Strip packing problem; Level algorithms

资金

  1. Third World Organisation for Women in Science (TWOWS)
  2. South African National Research Foundation [Gun 2072815]
  3. Harry Crossley Foundation

向作者/读者索取更多资源

Ail overview and comparison is provided Of a number of heuristics from the literature for the two-dimensional strip packing problem in which rectangles have to be packed without rotation. Heuristics producing only guillotine packings are considered. A new heuristic is also introduced and a number of modifications are Suggested to the existing heuristics. The resulting heuristics (known and new) are then compared statistically with respect to a large set of known benchmarks at a 5% level of significance, (C) 2008 Elsevier B.V. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.1
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据