3.7.170. Packing almost squares

Denotes the fact that a constraint can be used for solving the packing almost squares problem: tile a rectangle for which sides are consecutive integers by rectangles of size 1Γ—2,2Γ—3,...,nΓ—(n+1) which can be rotated by 90 degrees. The problem is described in http://www.stetson.edu/~efriedma/almost/. Since there does not always exist a tiling, one can also consider a variant where the goal is to find the rectangle with minimal area. FigureΒ 3.7.38 provides a solution for n=26 found by H.Β Simonis.

Figure 3.7.38. A solution to the packing almost squares problem for n=26

Download the geost instance for this example in XML or PROLOG format.