4-block heuristic for the rectangle packing problem

DOI10.1016/S0377-2217(96)00359-1zbMath0970.90082MaRDI QIDQ1296784

Uta Sommerweiß, Guntram Scheithauer

Publication date: 21 October 2001

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

zbMATH Keywords

heuristicscutting problemsPallet loading problempacking problems

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (6)

An improved typology of cutting and packing problems ⋮ A fast algorithm for two-dimensional pallet loading problems of large size ⋮ SLOPPGEN: a problem generator for the two-dimensional rectangular single large object placement problem with defects ⋮ An efficient approach for the multi-pallet loading problem ⋮ A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting ⋮ An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container

Cites Work

• Unnamed Item
• Unnamed Item
• Packing problems
• A typology of cutting and packing problems
• The Three-Dimensional Pallet Chart: An Analysis of the Factors Affecting the Set of Feasible Layouts for a Class of Two-Dimensional Packing Problems
• Practical Considerations of the Pallet-Loading Problem
• Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
• The G4-Heuristic for the Pallet Loading Problem
• Loading Multiple Pallets
• Recursive Computational Procedure for Two-dimensional Stock Cutting

This page was built for publication: 4-block heuristic for the rectangle packing problem