Premium
LP‐based bounds for the container and multi‐container loading problem
Author(s) -
Scheithauer G.
Publication year - 1999
Publication title -
international transactions in operational research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.032
H-Index - 52
eISSN - 1475-3995
pISSN - 0969-6016
DOI - 10.1111/j.1475-3995.1999.tb00151.x
Subject(s) - container (type theory) , computer science , mathematical optimization , mathematics , engineering , mechanical engineering
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.