.png){kind=icon}
Return
A new heuristic recursive algorithm for the strip rectangular packing problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2005.01.009.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A fast and new heuristic recursive algorithm to find a minimum height for two-dimensional strip rectangular packing problem is presented. This algorithm is mainly based on heuristic strategies and a recursive structure, and its average running time is T (n) = theta(n(3)). The computational results on a class of benchmark problems have shown that this algorithm not only finds shorter height than the known meta-heuristic ones, but also runs in shorter time. Especially for large test problems, it performs better. (c) 2005 Elsevier Ltd. All rights reserved.
Keywords:
packing problems
recursion
heuristic
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
2.0W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveShareSaveShareSave
View more