Space defragmentation for packing problems
From MaRDI portal
Publication:1926954
DOI10.1016/j.ejor.2012.05.031zbMath1253.90203OpenAlexW2013251181MaRDI QIDQ1926954
Zhaoyi Zhang, Wee-Chong Oon, Wenbin Zhu, Andrew E. B. Lim
Publication date: 29 December 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2012.05.031
Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Discrete location and assignment (90B80)
Related Items
A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ The pallet loading problem: three-dimensional bin packing with practical constraints
Uses Software
Cites Work
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
- The multiple container loading cost minimization problem
- On-line scheduling of parallel jobs in a list
- An optimal algorithm for rectangle placement
- The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
- The two-dimensional finite bin packing problem. II: New lower and upper bounds
- A typology of cutting and packing problems
- Heuristic algorithms for the three-dimensional bin packing problem
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
- Berth management in container terminal: the template design problem
- An improved typology of cutting and packing problems
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- Guided Local Search for the Three-Dimensional Bin-Packing Problem
- A Set-Covering-Based Heuristic Approach for Bin-Packing Problems
- A Tree Search Algorithm for Solving the Container Loading Problem
- Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
- A Maximal-Space Algorithm for the Container Loading Problem
- Two-Dimensional Finite Bin-Packing Algorithms
- Orthogonal Packings in Two Dimensions
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- The Three-Dimensional Bin Packing Problem
- A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
