Orthogonal packing of identical rectangles within isotropic convex regions

dc.creatorBIRGIN, Ernesto G.
dc.creatorLOBATO, Rafael D.
dc.date.accessioned2012-10-20T04:42:23Z
dc.date.accessioned2018-07-04T15:45:41Z
dc.date.available2012-10-20T04:42:23Z
dc.date.available2018-07-04T15:45:41Z
dc.date.created2012-10-20T04:42:23Z
dc.date.issued2010
dc.identifierCOMPUTERS & INDUSTRIAL ENGINEERING, v.59, n.4, p.595-602, 2010
dc.identifier0360-8352
dc.identifierhttp://producao.usp.br/handle/BDPI/30361
dc.identifier10.1016/j.cie.2010.07.004
dc.identifierhttp://dx.doi.org/10.1016/j.cie.2010.07.004
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1627001
dc.description.abstractA 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.
dc.languageeng
dc.publisherPERGAMON-ELSEVIER SCIENCE LTD
dc.relationComputers & Industrial Engineering
dc.rightsCopyright PERGAMON-ELSEVIER SCIENCE LTD
dc.rightsrestrictedAccess
dc.subjectPacking and cutting of rectangles
dc.subjectOrthogonal packing
dc.subjectIsotropic convex regions
dc.subjectFeasibility problems
dc.subjectNonlinear programming
dc.subjectModels
dc.titleOrthogonal packing of identical rectangles within isotropic convex regions
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución