A note on an L-approach for solving the manufacturer's pallet loading problem

DOI10.1057/PALGRAVE.JORS.2601960MaRDI QIDQ3372537zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 21 February 2006

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/palgrave.jors.2601960

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Combinatorial optimization (90C27)

Recommendations

• A heuristic method based on Lagrangean relaxation for a manufacturer's pallet loading problem
• The pallet loading problem: a review of solution methods and computational experiments
• A simple and effective recursive procedure for the manufacturer's pallet loading problem
• An efficient approach for the multi-pallet loading problem
• Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
• Analysis of upper bounds for the pallet loading problem
• scientific article; zbMATH DE number 1873246
• An exact algorithm for the pallet loading problem
• A Combined Data-Base and Algorithmic Approach to the Pallet-Loading Problem
• Practical Considerations of the Pallet-Loading Problem

Cited in

(11)

• A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
• Symmetry-breaking constraints for packing identical rectangles within polyhedra
• On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns
• Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
• The pallet loading problem: a review of solution methods and computational experiments
• A fast algorithm for identifying minimum size instances of the equivalence classes of the pallet loading problem
• A heuristic method based on Lagrangean relaxation for a manufacturer's pallet loading problem
• Column (and row) generation algorithms for the pallet loading 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
• Layer-layout-based heuristics for loading homogeneous items into a single container

This page was built for publication: A note on an L-approach for solving the manufacturer's pallet loading problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3372537)