1Hifi M. Exact algorithms for the guillotine strip cutting/packing problem. Computers & Operations Research,1998, 25(11): 925--940.
2Liu Guangli, Thompson K E. Influence of computational domain boundaries on internal structure in low-porosity sphere packings. Powder Technology, 2000,113(1-2): 185-196.
3Dowsland K A. The three-dimensional pallet chart: An analysis of the factors affecting the set of feasible layouts for a class of twodimensional packing problems [ J ]. Journal of the Operational Research Society, 1984,35:895 - 905.
4Dowsland K A, Dowsland W B. Packing Problems [ J]. European Journal of Operational Research, 1992, 56:2 -14.
5Dowsland K A. An exact algorithm for the pallet loading problems [ J]. European Journal of Operational Research, 1987,31:78 - 84.
6Sweeney P E, Paternoster E R. Cutting and packing problems: a categorized, application-orientated research [ J ]. Journal of Operation Research Society, 1992, 43 (7) : 691 -706.
7Smith A, DeCani P. An algorithm to the layout of boxes in pallets[ J]. Journal of Operation Research Society, 1980, 31 (7): 573- 578.
8Seheithauer G, Sommerweib U. 4 - Block heuristic for the rectangle packing problem [ J ]. European Journal of Operational Research,1998, 108:509-526.
9Bischoff E, Dowsland W B. An application of the micro to product design and distribution [ J ]. Journal of Operation Research Society,1982, 33(3): 271 -280.
10Bhattacharya S, Roy R, Bhattacharya S. An exact depth-first algorithm for the pallet loading problem [ J ]. European Journal of Operational Research, 1998, 110: 610 - 625.
5jEglese R W,Mercer A, Sohrabi B.The grocery superstore vehicle scheduling Problem [J]. Journal of the Operational Research Society, 2005, 56 (8): 902-911.
6Guenther Fuellerer, Karl F Doerner, Richard F Hard, Manuel Io14. Ant colony optimization for the two-dimensional loading vehicle routing problem. [J]Computers&Operations Research, 2009,36(3):655-673.
