New Improvements in Optimal Rectangle Packing

@inproceedings{Huang2003NewII,
  title={New Improvements in Optimal Rectangle Packing},
  author={Eric Huang and Richard E. Korf},
  booktitle={IJCAI},
  year={2003}
}
The rectangle packing problem consists of finding an enclosing rectangle of smallest area that can contain a given set of rectangles without overlap. Our algorithm picks the x-coordinates of all the rectangles before picking any of the y-coordinates. For the x-coordinates, we present a dynamic variable ordering heuristic and an adaptation of a pruning algorithm used in previous solvers. We then transform the rectangle packing problem into a perfect packing problem that has no empty space, and… CONTINUE READING
Highly Cited
This paper has 22 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-2 of 2 references

Pollack . Optimal rectangle packing : A metacsp approach

Michael D. Moffitt, E. Martha
-1

Similar Papers

Loading similar papers…