eprintid: 3509
rev_number: 10
eprint_status: archive
userid: 365
dir: disk0/00/00/35/09
datestamp: 2019-06-25 15:42:55
lastmod: 2019-06-25 15:42:55
status_changed: 2019-06-25 15:42:55
type: article
metadata_visibility: show
creators_name: Bui, Quoc Trung
creators_name: Vidal, Thibaut
creators_name: Ha, Minh Hoang
creators_id: minhhoang.ha@vnu.edu.vn
title: On three soft rectangle packing problems with guillotine constraints
ispublished: pub
subjects: IT
subjects: isi
divisions: fac_fit
abstract: 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.
date: 2019-05
date_type: published
publisher: Springer
official_url: https://link.springer.com/journal/10898
full_text_status: public
publication: Journal of global optimization
volume: 74
number: 1
pagerange: 45-62
refereed: TRUE
issn: 0925-5001
citation:   Bui, Quoc Trung and Vidal, Thibaut and Ha, Minh Hoang  (2019) On three soft rectangle packing problems with guillotine constraints.  Journal of global optimization, 74  (1).   pp. 45-62.  ISSN 0925-5001     
document_url: https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3509/1/Three%20soft%20rectangle%20packing%20problems.pdf