| Full text | |
| Author(s): |
Total Authors: 2
|
| Affiliation: | [1] Univ Sao Paulo, Dept Comp Sci, Inst Math & Stat, BR-05508090 Sao Paulo - Brazil
Total Affiliations: 1
|
| Document type: | Journal article |
| Source: | Optimization Letters; v. 7, n. 2, p. 375-405, FEB 2013. |
| Web of Science Citations: | 4 |
| Abstract | |
Two problems related to packing identical rectangles within a polyhedron are tackled in the present work. Rectangles are allowed to differ only by horizontal or vertical translations and possibly 90A degrees rotations. The first considered problem consists in packing as many identical rectangles as possible within a given polyhedron, while the second problem consists in finding the smallest polyhedron of a given type that accommodates a fixed number of identical rectangles. Both problems are modeled as mixed integer programming problems. Symmetry-breaking constraints that facilitate the solution of the MIP models are introduced. Numerical results are presented. (AU) | |
| FAPESP's process: | 10/10133-0 - Cutting, packing, lot-sizing and scheduling problems and their integration in industrial and logistics settings |
| Grantee: | Reinaldo Morabito Neto |
| Support Opportunities: | Research Projects - Thematic Grants |
| FAPESP's process: | 06/53768-0 - Computational methods of optimization |
| Grantee: | José Mário Martinez Perez |
| Support Opportunities: | Research Projects - Thematic Grants |
| FAPESP's process: | 09/10241-0 - Theory and software in computational methods for optimization |
| Grantee: | Ernesto Julián Goldberg Birgin |
| Support Opportunities: | Regular Research Grants |
| FAPESP's process: | 06/03496-3 - Theory and practice of cutting and packing problems |
| Grantee: | Marcos Nereu Arenales |
| Support Opportunities: | Research Projects - Thematic Grants |