On three soft rectangle packing problems with guillotine constraints. Bui, Q., Vidal, T., & Hà, M. Journal of Global Optimization, 74(1):45–62, 2019.
On three soft rectangle packing problems with guillotine constraints [pdf]Paper  doi  abstract   bibtex   1 download  
We investigate how to partition a rectangular region of length L1 and height L2 into n rectangles of given areas (a1,..., an) using two-stage guillotine cuts, so as to minimize either (i) the sum of the perimeters, (ii) the largest perimeter, or (iii) the maximum aspect ratio of the rectangles. These problems play an important role in the ongoing Vietnamese land-allocation reform, as well as in the optimization ofmatrix multiplication algorithms.We show that the first problem can be solved to optimality in O(n log n), while the two others are NP-hard. We propose mixed integer linear programming formulations and a binary search- based approach for solving the NP-hard problems. Experimental analyses are conducted to compare the solution approaches in terms of computational efficiency and solution quality, for different objectives.

Downloads: 1