A Branch-and-Cut Algorithm for Nesting Problems with Guillotine Constraints

• First exact method for nesting problems with guillotine cuts • An innovative branch and cut based on the dotted board model • Extension of the dotted board model to new nesting problem variants Cutting and packing problems have been widely studied because of their potential to improve industrial processes economically and environmentally. While many variants have been studied, some, particularly those with practical features necessary for industrial adoption, remain poorly addressed by exact m