A constraint programming approach for the two-dimensional rectangular packing problem with orthogonal orientations
- We propose a constraint-based approach for the two-dimensional rectangular packing problem with orthogonal orientations. This problem is to arrange a set of rectangles that can be rotated by 90 degrees into a rectangle of minimal size such that no two rectangles overlap. It arises in the placement of electronic devices during the layout of 2.5D System-in-Package integrated electronic systems. Moffitt et al. [8] solve the packing without orientations with a branch and bound approach and use constraint propagation. We generalize their propagation techniques to allow orientations. Our approach is compared to a mixed-integer program and we provide results that outperform it.
Download full text files
Export metadata
Additional Services
| Author: | M. Berger, M. Schröder, K.-H. Küfer |
|---|---|
| URN (permanent link): | urn:nbn:de:hbz:386-kluedo-15832 |
| Serie (Series number): | Berichte des Fraunhofer-Instituts für Techno- und Wirtschaftsmathematik (ITWM Report) (147) |
| Document Type: | Report |
| Language of publication: | English |
| Year of Completion: | 2008 |
| Year of Publication: | 2008 |
| Publishing Institute: | Fraunhofer-Institut für Techno- und Wirtschaftsmathematik |
| Date of the Publication (Server): | 2009/01/15 |
| Tag: | constraint propagation; non-overlapping constraints ; orthogonal orientations ; rectangular packing |
| Faculties / Organisational entities: | Fraunhofer (ITWM) |
| DDC-Cassification: | 5 Naturwissenschaften und Mathematik / 51 Mathematik / 510 Mathematik |
| Licence (German): | Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011 |
