A Polynomial Time Algorithm for the Guillotine Pallet Loading Problem
暂无分享,去创建一个
Guntram Scheithauer | Johannes Terno | Alexander G. Tarnowski | G. Scheithauer | J. Terno | A. Tarnowski
[1] A. I. Hinxman. The trim-loss and assortment problems: A survey , 1980 .
[2] Harald Dyckhoff,et al. Cutting and Packing in Production and Distribution , 1992 .
[3] John E. Beasley,et al. Algorithms for Unconstrained Two-Dimensional Guillotine Cutting , 1985 .
[4] Harald Dyckhoff,et al. A typology of cutting and packing problems , 1990 .
[5] P. Y. Wang,et al. Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems , 1983, Oper. Res..
[6] P. K. Agrawal,et al. Minimising trim loss in cutting rectangular blanks of a single size from a rectangular sheet using orthogonal guillotine cuts , 1993 .
[7] Antonio Albano,et al. A Solution of the Rectangular Cutting-Stock Problem , 1976, IEEE Transactions on Systems, Man, and Cybernetics.
[8] R. Gomory,et al. Multistage Cutting Stock Problems of Two and More Dimensions , 1965 .
[9] J. C. Herz,et al. Recursive computational procedure for two-dimensional stock cutting , 1972 .
[10] H. Selbmann,et al. Learning to recognize objects , 1999, Trends in Cognitive Sciences.
[11] Harold J. Steudel,et al. Generating Pallet Loading Patterns: A Special Case of the Two-Dimensional Cutting Stock Problem , 1979 .
[12] Nicos Christofides,et al. An Algorithm for Two-Dimensional Cutting Problems , 1977, Oper. Res..