A not necessarily connected figure consisting of non-overlapping unit squares is called a grid figure, e.g., every polyomino is a grid figure. Given a set of grid figures with associated values and a region, which is also represented as a grid figure, we consider the problem of packing grid figures of the given set in a non-overlapping way into the region subject to lower and upper quantity restrictions. The objective is to maximize the total value of the inserted grid figures.
Unable to display preview. Download preview PDF.
- Beasley, J.E.: An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure; Operations Research 1985, 49–64Google Scholar
- Meyer, B.: Object Oriented Software Construction; Prentice Hall, 1988Google Scholar
- Wolffram,J.: Packing Grid Figures: Exact Algorithms, Heuristics, and Object Oriented Implementation; Internal Report; Lehrstuhl fur Anwendungen des Operations Research, Universität Karlsruhe, GermanyGoogle Scholar