A Constraint-Based Approach for the Two-Dimensional Rectangular Packing Problem with Orthogonal Orientations

Martin Berger (), Michael Schröder and Karl-Heinz Küfer
Additional contact information
Martin Berger: Fraunhofer Institute for Industrial Mathematics
Michael Schröder: Fraunhofer Institute for Industrial Mathematics
Karl-Heinz Küfer: Fraunhofer Institute for Industrial Mathematics

Chapter 69 in Operations Research Proceedings 2008, 2009, pp 427-432 from Springer

Abstract: Summary 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. [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 it

Keywords: Constraint Programming; Constraint Propagation; Pruning Technique; Negative Cycle; Orthogonal Orientation (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-00142-0_69

Ordering information: This item can be ordered from
http://www.springer.com/9783642001420

DOI: 10.1007/978-3-642-00142-0_69

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().