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

MaRDI QIDQ4233346zbMATH OpenFDO

Authors Guntram Scheithauer

Publication date 16 March 1999

zbMATH Keywords

container loading problemmulti-container loadingoptimal packing

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• The multiple container loading cost minimization problem
• A bottleneck assignment approach to the multiple container loading problem
• A heuristic for multiple container loading problems
• Practical constraints in the container loading problem: comprehensive formulations and exact algorithm
• MIP-based approaches for the container loading problem with multi-drop constraints
• Approximate algorithms for the container loading problem
• The multiple container loading problem with preference
• Container loading with multi-drop constraints

Cited in

(5)

• An efficient approach for the multi-pallet loading problem
• MIP-based approaches for the container loading problem with multi-drop constraints
• A caving degree approach for the single container loading problem
• One-dimensional relaxations and LP bounds for orthogonal packing
• The multiple container loading cost minimization problem

This page was built for publication: LP-bounds for the container and multi-container loading problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4233346)