An AND/OR-graph approach has been proposed by Morabito et al. to solve non-staged and unconstrained two-dimensional guillotine cutting problems. Basically, this approach consists of representing cutting patterns as complete paths in an AND/OR graph (where nodes and arcs correspond to rectangles and cuts, respectively) and choosing a search strategy to traverse or enumerate the nodes of the graph. In this present paper, the AND/OR-graph approach is extended to solve staged and constrained problems. Computational experiments with examples from the literature are performed and indicate that this approach generates good and fast solutions using a microcomputer. In addition to the fact that the AND/OR-graph approach can handle important constraints, it can easily be extended to solve cutting and packing problems with multiple dimensions.
