Article ID: | iaor20083872 |
Country: | Brazil |
Volume: | 26 |
Issue: | 2 |
Start Page Number: | 185 |
End Page Number: | 202 |
Publication Date: | May 2006 |
Journal: | Pesquisa Operacional |
Authors: | Arenales M.N., Vianna A.C.G. |
Keywords: | graphs, programming: branch and bound |
This paper addresses to the two-dimensional cutting problem where a rectangular plate is to be cut into smaller rectangular pieces, in such a way as to minimize the waste. However, the plate has a number of well-located defects. We propose an AND/OR-graph approach to represent the feasible solutions and a branch and bound method in order to search the graph. Computational experiments show that the approach is effective.