A simple and effective recursive procedure for the manufacturer's pallet loading problem
From MaRDI portal
Publication:3157744
DOI10.1057/palgrave.jors.2600588zbMath1140.90517OpenAlexW2102843314WikidataQ57719579 ScholiaQ57719579MaRDI QIDQ3157744
No author found.
Publication date: 19 January 2005
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.2600588
Related Items
A fast algorithm for identifying minimum size instances of the equivalence classes of the pallet loading problem, Solving the pallet loading problem, An improved typology of cutting and packing problems, 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, Exact approaches for the unconstrained two-dimensional cutting problem with defects, A two-stage packing problem procedure, Analysis of upper bounds for the pallet loading problem, Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization, Um método heurístico baseado em relaxação Lagrangiana para o problema de carregamento de paletes do produtor, A branch-and-cut algorithm for the pallet loading problem, The pallet loading problem: a review of solution methods and computational experiments, Optimization of the distribution of small scale linear Fresnel reflectors on roofs of urban buildings, The pinwheel pattern and its application to the manufacturer's pallet-loading problem, Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem, An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container
Uses Software
