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.
Verfasserangaben: | M. Berger, M. Schröder, K.-H. Küfer |
---|---|
URN (Permalink): | urn:nbn:de:hbz:386-kluedo-15832 |
Schriftenreihe (Bandnummer): | Berichte des Fraunhofer-Instituts für Techno- und Wirtschaftsmathematik (ITWM Report) (147) |
Dokumentart: | Bericht |
Sprache der Veröffentlichung: | Englisch |
Jahr der Fertigstellung: | 2008 |
Jahr der Veröffentlichung: | 2008 |
Veröffentlichende Institution: | Fraunhofer-Institut für Techno- und Wirtschaftsmathematik |
Datum der Publikation (Server): | 15.01.2009 |
Freies Schlagwort / Tag: | constraint propagation; non-overlapping constraints ; orthogonal orientations ; rectangular packing |
Fachbereiche / Organisatorische Einheiten: | Fraunhofer (ITWM) |
DDC-Sachgruppen: | 5 Naturwissenschaften und Mathematik / 510 Mathematik |
Lizenz (Deutsch): |