Artificial Intelligence - Special issue on knowledge representation
Branch-and-bound placement for building block layout
DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
Exact Solution of the Two-Dimensional Finite Bon Packing Problem
Management Science
Sweep as a Generic Pruning Technique Applied to the Non-overlapping Rectangles Constraint
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Recent advances on two-dimensional bin packing problems
Discrete Applied Mathematics
Practical slicing and non-slicing block-packing without simulated annealing
Proceedings of the 14th ACM Great Lakes symposium on VLSI
Exhaustive approaches to 2D rectangular perfect packings
Information Processing Letters
The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
IEEE Transactions on Computers
Search Strategies for Rectangle Packing
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
New improvements in optimal rectangle packing
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
New filtering for the cumulative constraint in the context of non-overlapping rectangles
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Extending chip in order to solve complex scheduling and placement problems
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.00 |
We consider the problem of finding all enclosing rectangles of minimum area that can contain a given set of rectangles without overlap. Our rectangle packer chooses the x-coordinates of all the rectangles before any of the y-coordinates. We then transform the problem into a perfect-packing problem with no empty space by adding additional rectangles. To determine the y-coordinates, we branch on the different rectangles that can be placed in each empty position. Our packer allows us to extend the known solutions for a consecutive-square benchmark from 27 to 32 squares. We also introduce three new benchmarks, avoiding properties that make a benchmark easy, such as rectangles with shared dimensions. Our third benchmark consists of rectangles of increasingly high precision. To pack them efficiently, we limit the rectangles' coordinates and the bounding box dimensions to the set of subset sums of the rectangles' dimensions. Overall, our algorithms represent the current state-of-the-art for this problem, outperforming other algorithms by orders of magnitude, depending on the benchmark.