KLUEDO RSS FeedKLUEDO Dokumente/documents
https://kluedo.ub.uni-kl.de/index/index/
Thu, 15 Jan 2009 15:21:01 +0100Thu, 15 Jan 2009 15:21:01 +0100A constraint programming approach for the two-dimensional rectangular packing problem with orthogonal orientations
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/2046
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.M. Berger; M. Schröder; K.-H. Küferreporthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/2046Thu, 15 Jan 2009 15:21:01 +0100A novel non-linear approach to minimal area rectangular packing
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1981
This paper disscuses the minimal area rectangular packing problem of how to pack a set of specified, non-overlapping rectangels into a rectangular container of minimal area. We investigate different mathematical programming approaches of this and introduce a novel approach based on non-linear optimization and the \\\"tunneling effect\\\" achieved by a relaxation of the non-overlapping constraints.V. Maag; M. Berger; A. Winterfeld; K.-H. Küferreporthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1981Wed, 18 Jun 2008 15:29:02 +0200