Space defragmentation for packing problems
type: Item
instance of: scholarly article
title: Space defragmentation for packing problems
zbMATH Open document ID: 1253.90203
author: Wenbin Zhu
author: Zhaoyi Zhang
author: Wee-Chong Oon
author: Andrew Lim
published in: European Journal of Operational Research
publication date: 2012-12-29T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 6119524
zbMATH Keywords: packing
zbMATH Keywords: 2D/3D bin packing
zbMATH Keywords: space defragmentation
zbMATH Keywords: bin shuffling
zbMATH Keywords: comparability graph
zbMATH Keywords: visibility graph
describes a project that uses: Ts2pack
describes a project that uses: Algorithm 864
MaRDI profile type: Publication
full work available at URL: j.ejor.2012.05.031
OpenAlex ID: W2013251181
cites work: Orthogonal Packings in Two Dimensions
cites work: Two-Dimensional Finite Bin-Packing Algorithms
cites work: The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
cites work: The two-dimensional finite bin packing problem. II: New lower and upper bounds
cites work: The multiple container loading cost minimization problem
cites work: Extreme point-based heuristics for three-dimensional bin packing
cites work: TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
cites work: A typology of cutting and packing problems
cites work: A tree search algorithm for solving the container loading problem
cites work: Guided local search for the three-dimensional bin-packing problem
cites work: A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
cites work: An optimal algorithm for rectangle placement
cites work: Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
cites work: Heuristic algorithms for the three-dimensional bin packing problem
cites work: The Three-Dimensional Bin Packing Problem
cites work: Exact solution of the two-dimensional finite bin packing problem
cites work: A set-covering-based heuristic approach for bin-packing problems
cites work: Berth management in container terminal: the template design problem
cites work: A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
cites work: A maximal-space algorithm for the container loading problem
cites work: An improved typology of cutting and packing problems
cites work: On-line scheduling of parallel jobs in a list
DOI: 10.1016/J.EJOR.2012.05.031
Recommended article: On some packing problem related to dynamic storage allocation
Recommended article: Optimal allocation of storage space
Recommended article: Exactly solving packing problems with fragmentation
Recommended article: Dynamic storage allocation with limited compaction - complexity and some practical implications
Recommended article: Analysis of space allocation in a generally fragmented linear store
Recommended article: Q4778565
Recommended article: Q3044334
Recommended article: Packing arrays
Recommended article: Algorithms for packing problems
description: scientific article; zbMATH DE number 6119524