Exhaustive approaches to 2D rectangular perfect packings

Authors:
N. Lesh;J. Marks;A. McMahon;M. Mitzenmacher
Affiliations:
Mitsubishi Electric Research Laboratories, 201 Broadway, Cambridge, MA;Mitsubishi Electric Research Laboratories, 201 Broadway, Cambridge, MA;University of Miami, FL;Computer Science Department, Harvard University, Cambridge, MA
Venue:
Information Processing Letters
Year:
2004

Citing 3
Cited 17

Backtrack programming techniques

Communications of the ACM
Approximate strip packing

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
An Exact Approach to the Strip-Packing Problem

INFORMS Journal on Computing

New heuristic and interactive approaches to 2D rectangular strip packing

Journal of Experimental Algorithmics (JEA)
Power constrained and defect-probability driven SoC test scheduling with test set partitioning

Proceedings of the conference on Design, automation and test in Europe: Proceedings
BubbleSearch: a simple heuristic for improving priority-based greedy algorithms

Information Processing Letters
A two-level search algorithm for 2D rectangular packing problem

Computers and Industrial Engineering
A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem

Computers and Operations Research
Thermal-Aware SoC Test Scheduling with Test Set Partitioning and Interleaving

Journal of Electronic Testing: Theory and Applications
Collaboration Between Hyperheuristics to Solve Strip-Packing Problems

IFSA '07 Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing
A Tabu Search Algorithm with Direct Representation for Strip Packing

EvoCOP '09 Proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization
Brief paper: A revision of recent approaches for two-dimensional strip-packing problems

Engineering Applications of Artificial Intelligence
Brief paper: A revision of recent approaches for two-dimensional strip-packing problems

Engineering Applications of Artificial Intelligence
BubbleSearch: A simple heuristic for improving priority-based greedy algorithms

Information Processing Letters
An evolutionary hyperheuristic to solve strip-packing problems

IDEAL'07 Proceedings of the 8th international conference on Intelligent data engineering and automated learning
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
On packing squares into a rectangle

Computational Geometry: Theory and Applications
A simple randomized algorithm for two-dimensional strip packing

Computers and Operations Research
Bidirectional best-fit heuristic considering compound placement for two dimensional orthogonal rectangular strip packing

Expert Systems with Applications: An International Journal
Optimal rectangle packing: an absolute placement approach

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper, we consider the two-dimensional rectangular strip packing problem, in the case where there is a perfect packing; that is, there is no wasted space. One can think of the problem as a jigsaw puzzle with oriented rectangular pieces. Although this comprises a quite special case for strip packing, we have found it useful as a subroutine in related work. We demonstrate a simple pruning approach that makes a branch-and-bound-based exhaustive search extremely effective for problems with less than 30 rectangles.