LP‐based bounds for the container and multi‐container loading problem
暂无分享,去创建一个
In this paper we develop new bounds for problems of optimal packing of small (rectangular- shaped) pieces (boxes) within one or several larger containers, that is bounds for the so-called Container Loading Problem and the Multi-Container Loading Problem. These new bounds are generalizations of an LP-bound for the Rectangle Packing Problem.
[1] Heinz Isermann,et al. Ein Planungssystem zur Optimierung der Palettenbeladung mit kongruenten rechteckigen Versandgebinden , 1987 .
[2] Harald Dyckhoff,et al. A typology of cutting and packing problems , 1990 .
[3] Harald Dyckhoff,et al. Cutting and Packing in Production and Distribution , 1992 .