| dc.creator | Santos, André Gustavo dos | |
| dc.creator | Monaci, Michele | |
| dc.date | 2019-01-03T15:56:05Z | |
| dc.date | 2019-01-03T15:56:05Z | |
| dc.date | 2018-12 | |
| dc.date.accessioned | 2023-09-27T21:38:39Z | |
| dc.date.available | 2023-09-27T21:38:39Z | |
| dc.identifier | 1572-9338 | |
| dc.identifier | https://doi.org/10.1007/s10479-017-2746-2 | |
| dc.identifier | http://www.locus.ufv.br/handle/123456789/22903 | |
| dc.identifier.uri | https://repositorioslatinoamericanos.uchile.cl/handle/2250/8963967 | |
| dc.description | We consider a two-dimensional problem in which one is required to split a given rectangular bin into the smallest number of items. The resulting items must be squares to be packed, without overlapping, into the bin so as to cover all the given rectangle. We present a mathematical model and a heuristic algorithm that is proved to find the optimal solution in some special cases. Then, we introduce a relaxation of the problem and present different exact approaches based on this relaxation. Finally, we report computational experiments on the performances of the algorithms on a large set of randomly generated instances. | |
| dc.format | pdf | |
| dc.format | application/pdf | |
| dc.language | eng | |
| dc.publisher | Annals of Operations Research | |
| dc.relation | Volume 271, Issue 2, Pages 831– 851, December 2018 | |
| dc.rights | Springer Science+Business Media, LLC, part of Springer Nature 2018. | |
| dc.subject | Two-dimensional packing | |
| dc.subject | Mathematical models | |
| dc.subject | Exact algorithms | |
| dc.subject | Computational experiments | |
| dc.title | Minimum tiling of a rectangle by squares | |
| dc.type | Artigo | |
