2Dycyhoff. A Typology of Cutting and Packing Problems [J]. European Journal of Operational Research, 1990,44: 145- 159.
3Wascher G, Hauβner H, Schumann H. An Improved Typology of Cutting and Packing Problems [ J]. European Journal of Operattional Research, 2006, 183 : 33 - 51.
4Jakobs S. On Genetic Algorithms for the Packing of Polygons[J]. European Journal of Operattional Research, 1996, 88: 165- 181.
5Liu D, Teng H. An Improved BL-Algorithm for Genetic Algorithm of the Orthogonal Packing of Rectangles I J]. European Journal of Oprational Research, 1999,112: 413 - 420.
6Hopper E, Turton B C H. An Empirical Investigation of Meta-Heuristic and Heuristic Algorithm for A 2D Packing Problem [J]. European Journal of Operational Research, 2001,128:34 - 57.
7Leung T W, Chan C K, Troutt M D. Application of A Mixed Simulated Annealing-Algorithm Heuristic for the Two-Dimensional Orthogonal Packing Problem[J]. European Journal of Operational Research, 2003, 145:530 - 542.
8Rubinstein R Y. Cross-Entropy Method for Combinatorial and Continuous Optimization[J]. Methodology and Computing in Applied Probability, 1999,2:127 - 190.
9Rubinstein R Y. Cross-Entropy Method and Rare-Events for Maximal Cut and Bipartition Problems [J]. ACM Transactions on Modeling and Computer Simulation, 2002, 12:27 - 53.
10DeBoer P T, Kroese D P, Rubinstein R Y. A Fast Cross-Entropy Method for Estimating Buffer Overflows in Queueing[ J]. Networks Management Science, 2004, 50: 883 - 895.
