The minimum size instance of a Pallet Loading Problem equivalence class
From MaRDI portal
Publication:858408
DOI10.1016/j.ejor.2006.03.009zbMath1180.90178OpenAlexW2005924538MaRDI QIDQ858408
Gustavo H. A. Martins, Robert F. Dell
Publication date: 9 January 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.03.009
Related Items (5)
A fast algorithm for identifying minimum size instances of the equivalence classes of the pallet loading problem ⋮ Solving the pallet loading problem ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ The pallet loading problem: a review of solution methods and computational experiments ⋮ The pinwheel pattern and its application to the manufacturer's pallet-loading problem
Cites Work
- Unnamed Item
- How to use structural constraints to compute an upper bound for the pallet loading problem
- A branch-and-cut algorithm for the pallet loading problem
- An exact algorithm for the pallet loading problem
- 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
- 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
- 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: The minimum size instance of a Pallet Loading Problem equivalence class
