TY  - JOUR
ID  - SisLab3509
UR  - https://link.springer.com/journal/10898
IS  - 1
A1  - Bui, Quoc Trung
A1  - Vidal, Thibaut
A1  - Ha, Minh Hoang
Y1  - 2019/05//
N2  - 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.
PB  - Springer
JF  - Journal of global optimization
VL  - 74
SN  - 0925-5001
TI  - On three soft rectangle packing problems with guillotine constraints
SP  - 45
AV  - public
EP  - 62
ER  -