LP-based bounds for the container and multi-container loading problem

作     者：Scheithauer, G. 

作者机构：Dresden University of Technology Institute for Numerical Mathematics Germany 

出 版 物：《International Transactions in Operational Research》 (Int. Trans. Oper. Res.)

年 卷 期：1999年第6卷第2期

页      面：199-213页

学科分类：12[管理学] 0202[经济学-应用经济学] 1202[管理学-工商管理] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 070105[理学-运筹学与控制论] 0701[理学-数学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：Bounds Container loading problem Cutting problem Linear programming relaxation Multi-container loading problem Packing problem Pallet loading problem 

摘      要：New relaxations are developed in this paper for problems of optimal packing of small (rectangular-shaped) pieces within one or several larger containers. Based on these relaxations tighter bounds for the Container Loading Problem (CLP) and the Multi-Container Loading Problem (MCLP) are obtained. The new relaxations for the CLP and MCLP lead to linear programming problems. A corresponding solution approach is discussed which is based on a column generation technique. Results of computational tests are also given. © 1999 Blackwell Publishing Ltd.