A heuristic for packing boxes into a container
暂无分享，去创建一个
Abstract Given a container of known dimensions and a collection of rectangular boxes with known dimensions and number of boxes of each type, the problem is to find suitable positions for placing the boxes in the container in such a way that all the boxes can be fitted in. A heuristic for computer or manual operation is described.
[1] J. C. Herz,et al. Recursive computational procedure for two-dimensional stock cutting , 1972 .
[2] David S. Johnson,et al. Fast Algorithms for Bin Packing , 1974, J. Comput. Syst. Sci..
[3] R. Gomory,et al. Multistage Cutting Stock Problems of Two and More Dimensions , 1965 .
[4] Nicos Christofides,et al. The Loading Problem , 1971 .