On three soft rectangle packing problems with guillotine constraints

Quoc Trung Bui (), Thibaut Vidal () and Minh Hoàng Hà ()
Additional contact information
Quoc Trung Bui: Daily-Opt Joint Stock Company
Thibaut Vidal: Pontifícia Universidade Católica do Rio de Janeiro
Minh Hoàng Hà: Vietnam National University

Journal of Global Optimization, 2019, vol. 74, issue 1, No 3, 45-62

Abstract: Abstract We investigate how to partition a rectangular region of length $$L_1$$ L 1 and height $$L_2$$ L 2 into n rectangles of given areas $$(a_1, \dots , a_n)$$ ( a 1 , ⋯ , a n ) 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 $${{\mathcal {O}}}(n \log n)$$ 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.

Keywords: Soft rectangle packing; Guillotine constraints; Complexity analysis; Mixed integer linear programming (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10898-019-00741-w Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jglopt:v:74:y:2019:i:1:d:10.1007_s10898-019-00741-w

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-019-00741-w

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().