Two-Dimensional Cutting Problems: Mathematical Formulations and Solution Methods
Computational optimization methods for problems with simple convex constraints
Orthogonality of packings of paths and independent sets partitions on bipartite gr...
| Full text | |
| Author(s): |
Total Authors: 2
|
| Affiliation: | [1] Univ Sao Paulo, Inst Math & Stat, Dept Comp Sci, BR-05508090 Sao Paulo - Brazil
Total Affiliations: 1
|
| Document type: | Journal article |
| Source: | COMPUTERS & INDUSTRIAL ENGINEERING; v. 59, n. 4, p. 595-602, NOV 2010. |
| Web of Science Citations: | 16 |
| Abstract | |
A mixed integer continuous nonlinear model and a solution method for the problem of orthogonally packing identical rectangles within an arbitrary convex region are introduced in the present work. The convex region is assumed to be made of an isotropic material in such a way that arbitrary rotations of the items, preserving the orthogonality constraint, are allowed. The solution method is based on a combination of branch and bound and active-set strategies for bound-constrained minimization of smooth functions. Numerical results show the reliability of the presented approach. (C) 2010 Elsevier Ltd. All rights reserved. (AU) | |
| FAPESP's process: | 06/53768-0 - Computational methods of optimization |
| Grantee: | José Mário Martinez Perez |
| Support Opportunities: | Research Projects - Thematic Grants |