Efficient automated pallet loading

DOI10.1016/0377-2217(90)90358-IzbMath0684.90078MaRDI QIDQ1825763

Kathryn A. Dowsland

Publication date: 1990

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

zbMATH Keywords

packingroboticsset partitioningefficient pallet loading

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Production models (90B30) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (7)

A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem ⋮ An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems ⋮ An analytical model for the container loading problem ⋮ An exact algorithm for general, orthogonal, two-dimensional knapsack problems ⋮ Packing problems ⋮ The pallet packing problem for non-uniform box sizes ⋮ Stability aspects of pallet loading

Uses Software

• Algorithm 457

Cites Work

• Unnamed Item
• An exact algorithm for the pallet loading problem
• Practical Considerations of the Pallet-Loading Problem
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• Optimal set partitioning, matchings and lagrangian duality
• An Algorithm for Large Set Partitioning Problems
• The Set-Partitioning Problem: Set Covering with Equality Constraints
• Algorithm 457: finding all cliques of an undirected graph

This page was built for publication: Efficient automated pallet loading