Use este identificador para citar ou linkar para este item:
https://locus.ufv.br//handle/123456789/22903
Tipo: | Artigo |
Título: | Minimum tiling of a rectangle by squares |
Autor(es): | Santos, André Gustavo dos Monaci, Michele |
Abstract: | 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. |
Palavras-chave: | Two-dimensional packing Mathematical models Exact algorithms Computational experiments |
Editor: | Annals of Operations Research |
Tipo de Acesso: | Springer Science+Business Media, LLC, part of Springer Nature 2018. |
URI: | https://doi.org/10.1007/s10479-017-2746-2 http://www.locus.ufv.br/handle/123456789/22903 |
Data do documento: | Dez-2018 |
Aparece nas coleções: | Artigos |
Arquivos associados a este item:
Arquivo | Descrição | Tamanho | Formato | |
---|---|---|---|---|
artigo.pdf Until 2100-12-31 | Texto completo | 709,39 kB | Adobe PDF | Visualizar/Abrir ACESSO RESTRITO |
Os itens no repositório estão protegidos por copyright, com todos os direitos reservados, salvo quando é indicado o contrário.