We consider the problem of finding an arrangement of rectangles with given areas that minimizes the total length of all inner and outer border lines. This problem is tackled by several different linear and nonlinear mixed-integer optimization models, all having their individual pros and cons.