An effective recursive partitioning approach for the packing of identical rectangles in a rectangle

DOI10.1057/jors.2008.141zbMath1196.90020OpenAlexW2109314481WikidataQ56169161 ScholiaQ56169161MaRDI QIDQ4933609

No author found.

Publication date: 14 October 2010

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

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

zbMATH Keywords

dynamic programmingcutting and packingmanufacturer's pallet loading problemnon-guillotine cutting patternraster pointswoodpulp stowage problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Dynamic programming (90C39)

Related Items (12)

A fast algorithm for identifying minimum size instances of the equivalence classes of the pallet loading problem ⋮ Logic based Benders' decomposition for orthogonal stock cutting problems ⋮ Packing unequal rectangles and squares in a fixed size circular container using formulation space search ⋮ The multiperiod two‐dimensional non‐guillotine cutting stock problem with usable leftovers ⋮ Symmetry-breaking constraints for packing identical rectangles within polyhedra ⋮ Minimum tiling of a rectangle by squares ⋮ Three-dimensional container loading models with cargo stability and load bearing constraints ⋮ Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing ⋮ 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 ⋮ Optimization of the distribution of small scale linear Fresnel reflectors on roofs of urban buildings ⋮ On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns

This page was built for publication: An effective recursive partitioning approach for the packing of identical rectangles in a rectangle