Gilmore P C,Gomory R E.A linear programming approach to the cutting-stock problem[J].Operations Research,1961,9:849-859.
[2]
Herz J C.Recursive computational procedure for two-dimensional stock cutting[J].IBM Journal of Research and Development,1972,16:462-469.
[3]
Christofides N.Whitlock C.An algorithm for two-dimensional cutting problems[J].Operations Research,1977,25:30-44.
[4]
Hifi M.Exact algorithms for large-scale unconstrained two and three staged cutting problems[J].Computational Optimization and Applications,2001,18:63-88.
[5]
Hifi M.Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems[J].Journal of Combinatorial Optimization,2004,8:65-84.
[6]
Morabito R,Arenales M N.Staged and constrained two-dimensional guillotine cutting problems:an AND/OR-graph approach[J].European Journal of Operational Research,1996,94(3):548-560.
[7]
Scheithauer G,Sommerweiβ U.4-block heuristic for the rectangle packing problem[J].European Journal of Operational Research,1998,108(3):509-526.
[8]
Hifi M.The DH/KD algorithm:a hybrid approach for unconstrained two-dimensional cutting problems[J].European Journal of Operational Research,1997,97(1):41-52.
