A fast algorithm for identifying minimum size instances of the equivalence classes of the pallet loading problem

DOI10.1016/J.EJOR.2014.02.008zbMath1338.90220OpenAlexW2075265644MaRDI QIDQ296576

Jianzhong Cha, Yiping Lu

Publication date: 23 June 2016

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

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

zbMATH Keywords

packingequivalence classpallet loading problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete location and assignment (90B80) Discrete geometry (52C99)

Related Items (1)

A heuristic algorithm for container loading of pallets with infill boxes

Cites Work

• The minimum size instance of a Pallet Loading Problem equivalence class
• Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
• Computing stable loads for pallets
• Determining an upper bound for a class of rectangular packing problems
• A branch-and-cut algorithm for the pallet loading problem
• An exact algorithm for the pallet loading problem
• A typology of cutting and packing problems
• Constraints in container loading -- a state-of-the-art review
• Solving the pallet loading problem
• Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem
• An improved typology of cutting and packing problems
• A simple and effective recursive procedure for the manufacturer's pallet loading problem
• The Three-Dimensional Pallet Chart: An Analysis of the Factors Affecting the Set of Feasible Layouts for a Class of Two-Dimensional Packing Problems
• A note on an L-approach for solving the manufacturer's pallet loading problem
• Practical Considerations of the Pallet-Loading Problem
• A Combined Data-Base and Algorithmic Approach to the Pallet-Loading Problem
• An L-approach for packing (ℓ, w)-rectangles into rectangular and L-shaped pieces
• The G4-Heuristic for the Pallet Loading Problem
• An effective recursive partitioning approach for the packing of identical rectangles in a rectangle
• Analysis of upper bounds for the pallet loading problem
• A fast algorithm for two-dimensional pallet loading problems of large size

This page was built for publication: A fast algorithm for identifying minimum size instances of the equivalence classes of the pallet loading problem