[1]姜永亮,杨志强,张诚一.基于两阶段的分段单一毛坯矩形优化布局[J].计算机应用,2011,31(6):1689-1691.[2]季君,陆一平,查建中,等.生成矩形毛坯最优两段布局方式的确定型算法[J].计算机学报,2012,35(1):183-191.[3]蒋兴波,吕肖庆,刘成城.二维矩形条带装箱问题的底部左齐择优匹配算法[J].软件学报,2009,6(20):1528-1538.[4]黄文奇,刘景发.基于欧氏距离的矩形Paking问题的确定性启发式求解算法[J].计算机学报,2006,29(5):735-739.[5]SEONG Y J,KANG M K.A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems[J].Operations Research Letters,2003,31(4):301-307.[6]HIFI M,ZISSIMOPOULOS V.A recursive exact algorithm for weighted two-dimensional cutting[J].European Journal of Operational Research,1996,91(3):553-564.[7]HIFI M.Exact algorithms for large-scale unconstrained two and three staged cutting problems[J].Computational Optimization and Applications,2001,18(1):63-88.[8]CUI Y.Generating optimal T-shape cutting patterns for rectangular blanks[J].Journal of Engineering Manufacture,2004,218(8):857-866.[9]季君.基于块结构的矩形件两阶段优化布局[D].桂林:广西师范大学,2006.[10]ALVAREZ-VALDES R,PARAJON A,TAMARIT J M.A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems[J].Computers and Operations Research,2002,29(7):925-947.[11]崔耀东.计算机布局及应用[M].北京:机械工业出版社,2004.[12]CUI Y,WANG Z,LI J.Exact and heuristic algorithms for staged cutting problems[J].Journal of Engineering Manufacture,2005,219(2):201-208.[13]GILMORE P C,GOMORY R E.Multistage cutting stock problems of two and more dimensions[J].Operations Research,1965,13(1):94-119.[14]KELLERER H,PFERSCHY U,PISINGER D.Knapsack problems[M].Berlin:Springer-Verlag,2004. |