4-block heuristic for the rectangle packing problem

DOI10.1016/S0377-2217(96)00359-1MaRDI QIDQ1296784zbMATH OpenFDO

Authors Guntram Scheithauer, Uta Sommerweiß

Publication date 21 October 2001

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

zbMATH Keywords

heuristicspacking problemscutting problemsPallet loading problem

Mathematics Subject Classification ID

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

Recommendations

• An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem
• A new heuristic algorithm for rectangle packing
• A partition-based heuristic algorithm for the rectilinear block packing problem
• Computational Science – ICCS 2005
• An efficient deterministic heuristic for two-dimensional rectangular packing
• A NEW HEURISTIC ALGORITHM FOR CONSTRAINED RECTANGLE-PACKING PROBLEM
• Efficient implementations of construction heuristics for the rectilinear block packing problem
• Heuristic algorithm for the rectangular packing problem with static non-equilibrium constraint

Cites work

• scientific article; zbMATH DE number 3945878 (Why is no real title available?)
• scientific article; zbMATH DE number 4074379 (Why is no real title available?)
• A typology of cutting and packing problems
• Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
• Loading Multiple Pallets
• Packing problems
• Practical Considerations of the Pallet-Loading Problem
• Recursive Computational Procedure for Two-dimensional Stock Cutting
• The G4-Heuristic for the Pallet Loading Problem
• The Three-Dimensional Pallet Chart: An Analysis of the Factors Affecting the Set of Feasible Layouts for a Class of Two-Dimensional Packing Problems

Cited in

(9)

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

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

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