An L-approach for packing (ℓ, w)-rectangles into rectangular and L-shaped pieces
From MaRDI portal
Publication:4661079
DOI10.1057/palgrave.jors.2601553zbMath1060.90063OpenAlexW2099446973WikidataQ57719568 ScholiaQ57719568MaRDI QIDQ4661079
No author found.
Publication date: 4 April 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.2601553
Related Items
A fast algorithm for identifying minimum size instances of the equivalence classes of the pallet loading problem, Solving the pallet loading problem, A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem, Logic based Benders' decomposition for orthogonal stock cutting problems, 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, Three-dimensional container loading models with cargo stability and load bearing constraints, Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization, A branch-and-cut algorithm for the pallet loading problem, Grids for cutting and packing problems: a study in the 2D knapsack problem, 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, Phorma: perfectly hashable order restricted multidimensional arrays, Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem, On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns
