A note on an L-approach for solving the manufacturer's pallet loading problem
From MaRDI portal
Publication:3372537
DOI10.1057/palgrave.jors.2601960zbMath1142.90469OpenAlexW2115029143WikidataQ57719562 ScholiaQ57719562MaRDI QIDQ3372537
No author found.
Publication date: 21 February 2006
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601960
Related Items (8)
A fast algorithm for identifying minimum size instances of the equivalence classes of the pallet loading problem ⋮ A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem ⋮ 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 ⋮ Symmetry-breaking constraints for packing identical rectangles within polyhedra ⋮ Layer-layout-based heuristics for loading homogeneous items into a single container ⋮ Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization ⋮ The pallet loading problem: a review of solution methods and computational experiments
This page was built for publication: A note on an L-approach for solving the manufacturer's pallet loading problem
