Berger, M.M.BergerSchröder, M.M.SchröderKüfer, K.-H.K.-H.Küfer2022-03-112022-03-112009https://publica.fraunhofer.de/handle/publica/36516210.1007/978-3-642-00142-0_69We 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. [2] 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 iten003006519conference paper