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

✍ Scribed by Guntram Scheithauer

• Book ID: 104369600
• Publisher: John Wiley and Sons
• Year: 1999
• Tongue: English
• Weight: 182 KB
• Volume: 6
• Category: Article
• ISSN: 0969-6016
• DOI: 10.1016/s0969-6016(98)00035-5

✦ Synopsis

New relaxations are developed in this paper for problems of optimal packing of small (rectangularshaped) 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.