[1]LODI A, MARTELLO S, MONACI M. Two-dimensional packing problems: a survey [J]. European Journal of Operational Research, 2002, 141(2): 241-252.[2]LEUNG J Y T, TAM T W, WONG C S, et al. Packing squares into square [J]. Journal of Parallel and Distributed Computing, 1990, 10(3): 271-275.[3]LIU D Q, TENG H F. An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles [J]. European Journal of Operational Research, 1999, 112(2): 413-419.[4]HIFI M, M'HALLAH R. A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregularshapes [J]. International Transactions in Operational Research, 2003, 10(3): 195-216.[5]MARTELLO S, MONACI M, VIGO D. An exact approach to the strip-packing problem [J]. INFORMS Journal on Computing, 2003, 15(3): 310-319.[6]陈端兵,黄文奇.求解矩形 packing 问题的贪心算法[J].计算机工程,2007,33(4):160-162.[7]张德富,韩水华,叶卫国.求解矩形Packing问题的砌墙式启发式算法[J].计算机学报,2008,31(3):509-515.[8]梁军,王强,程灿,等.基于离散粒子群算法的矩形件优化排样[J].计算机工程与设计,2007,28(11):5359-5510.[9]LIN C C. A genetic algorithm for solving the two-dimensional assortment problem [J]. Computers and Industrial Engineering, 2006, 50(1): 175-184.[10]LEUNG S C H, ZHANG D F, SIM K M. A two-stage intelligent search algorithm for the two-dimensional strip packing problem [J]. European Journal of Operational Research, 2011, 215(1): 57-69.[11]LEUNG S C H, ZHANG D F. A fast layer-based heuristic for non-guillotine strip packing [J]. Expert Systems with Applications: An International Journal, 2011, 38(10):13032-13042.[12]LEUNG S C H, ZHANG D F, ZHOU C L, et al. A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem [J]. Computers and Operations Research, 2012, 39(1): 64-73.[13]何琨, 黄文奇.三维矩形 Packing问题的拟人求解算法[J].中国科学:信息科学,2010,40(12):1586-1595.[14]VASSILIADIS V S. Two-dimensional stock cutting and rectangle packing: binary tree model representation for local search optimization methods [J]. Journal of Food Engineering, 2005, 70(3): 257-268. |