Computing stable loads for pallets

DOI10.1016/J.EJOR.2010.05.005zbMath1206.90099OpenAlexW1981179101MaRDI QIDQ992703

W. Kocjan, Kenneth Holmström

Publication date: 9 September 2010

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.05.005

zbMATH Keywords

distributionpackinglogisticspallet loading

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (3)

A fast algorithm for identifying minimum size instances of the equivalence classes of the pallet loading problem ⋮ Priority-based bin packing with subset constraints ⋮ Order and static stability into the strip packing problem

Uses Software

• TOMLAB

Cites Work

• Stability aspects of pallet loading
• Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
• A branch-and-cut algorithm for the pallet loading problem
• An exact algorithm for the pallet loading problem
• Solving the pallet loading problem
• An improved typology of cutting and packing problems
• Practical Considerations of the Pallet-Loading Problem
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• Generating Pallet Loading Patterns: A Special Case of the Two-Dimensional Cutting Stock Problem
• An Algorithm for Two-Dimensional Cutting Problems
• A three-dimensional pallet loading method for single-size boxes
• The G4-Heuristic for the Pallet Loading Problem
• Recursive Computational Procedure for Two-dimensional Stock Cutting

This page was built for publication: Computing stable loads for pallets