Abstract
Irregular (non-rectangular and non-circular) cutting problems (or nesting problems) are problems that aim to determine an optimal placement of irregular pieces (items) inside a bigger rectangular or irregular piece (that we will simply call piece), respecting a given item demand. Among these problems, we have the irregular bin packing problems, in which the pieces have a fixed size and we…