Minimum tiling of a rectangle by squares

Collection Location Koleksi E-book & E-Journal Perpustakaan Pusat Unila
Edition vol.271issue 2
Call Number
ISBN/ISSN 15729338
Author(s) Monaci, Michele
Gustavo dos Santos, André
Subject(s) Business and Management
Classification NONE
Series Title
GMD E-Journal
Language English
Publisher Springer
Publishing Year 2018
Publishing Place Switzerland
Abstract/Notes 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. Keywords Two-dimensional packing · Mathematical models · Exact algorithms · Computational experiments
Specific Detail Info
  Back To Previous