Please use this identifier to cite or link to this item:
|Type:||Artigo de periódico|
|Title:||An And-or-graph Approach For Two-dimensional Cutting Problems|
|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.|
|Citation:||European Journal Of Operational Research. , v. 58, n. 2, p. 263 - 271, 1992.|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.