4-block heuristic for the rectangle packing problem
type: Item
instance of: scholarly article
title: 4-block heuristic for the rectangle packing problem
zbMATH Open document ID: 0970.90082
DOI: 10.1016/S0377-2217(96)00359-1
author: Guntram Scheithauer
author: Uta Sommerweiß
published in: European Journal of Operational Research
publication date: 2001-10-21T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 1320321
zbMATH Keywords: packing problems
zbMATH Keywords: Pallet loading problem
zbMATH Keywords: cutting problems
zbMATH Keywords: heuristics
MaRDI profile type: Publication
cites work: Loading Multiple Pallets
cites work: Practical Considerations of the Pallet-Loading Problem
cites work: The Three-Dimensional Pallet Chart: An Analysis of the Factors Affecting the Set of Feasible Layouts for a Class of Two-Dimensional Packing Problems
cites work: Q3716813
cites work: Packing problems
cites work: A typology of cutting and packing problems
cites work: Recursive Computational Procedure for Two-dimensional Stock Cutting
cites work: The G4-Heuristic for the Pallet Loading Problem
cites work: Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
cites work: Q3805803
Recommended article: An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem
Recommended article: A new heuristic algorithm for rectangle packing
Recommended article: A partition-based heuristic algorithm for the rectilinear block packing problem
Recommended article: Computational Science – ICCS 2005
Recommended article: An efficient deterministic heuristic for two-dimensional rectangular packing
Recommended article: A NEW HEURISTIC ALGORITHM FOR CONSTRAINED RECTANGLE-PACKING PROBLEM
Recommended article: Efficient implementations of construction heuristics for the rectilinear block packing problem
Recommended article: Q4688868
description: scientific article; zbMATH DE number 1320321