Journal
JOURNAL OF GLOBAL OPTIMIZATION
Volume 74, Issue 1, Pages 45-62Publisher
SPRINGER
DOI: 10.1007/s10898-019-00741-w
Keywords
Soft rectangle packing; Guillotine constraints; Complexity analysis; Mixed integer linear programming
Funding
- National Council for Scientific and Technological Development (CNPQ) [308498/2015-1]
- FAPERJ in Brazil [E-26/203.310/2016]
Ask authors/readers for more resources
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 of matrix multiplication algorithms. We show that the first problem can be solved to optimality in O(nlogn), 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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available