Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/99467
Type: Artigo de periódico
Title: An And-or-graph Approach For Two-dimensional Cutting Problems
Author: Morabito R.N.
Arenales M.N.
Arcaro V.F.
Abstract: The problem of generating guillotine cutting patterns for a rectangular plate is studied and a type of structure is proposed for representing the solution of the problem, called and-or graph, which is commonly used in the Artificial Intelligence environment. To search the graph we combined two classical strategies: depth-first and hill-climbing. Further, some heuristics are considered and computational results are presented, relating their performance on examples from both literature as well as randomly generated. © 1992.
Editor: 
Rights: fechado
Identifier DOI: 10.1016/0377-2217(92)90212-R
Address: http://www.scopus.com/inward/record.url?eid=2-s2.0-0026853585&partnerID=40&md5=31f9e1001a654623db6db450b5d27133
Date Issue: 1992
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File SizeFormat 
2-s2.0-0026853585.pdf563.92 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.