Corner occupying theorem for the two-dimensional integral rectangle packing problem
From MaRDI portal
Publication:362160
DOI10.1007/s11432-012-4702-8zbMath1270.90056arXiv1111.3715OpenAlexW2963740413MaRDI QIDQ362160
Wenqi Huang, Tao Ye, Duan-bing Chen
Publication date: 20 August 2013
Published in: Science China. Information Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1111.3715
Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- A new heuristic algorithm for rectangle packing
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- Two-dimensional packing problems: a survey
- A caving degree approach for the single container loading problem
- Exhaustive approaches to 2D rectangular perfect packings
- The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
- Two-Dimensional Finite Bin-Packing Algorithms
- Orthogonal Packings in Two Dimensions
- An Algorithm for Two-Dimensional Cutting Problems
- The Three-Dimensional Bin Packing Problem
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems
