A Lower Bound for the Cutting Stock Problem with a Limited Number of Open Stacks

This paper proposes an algorithm to compute a lower bound for the cutting stock problem subject to a limited number s of open stacks. The algorithm employs an enumeration scheme based on algebraic properties of the problem. Search is shortened by bounds computed via column generation and by symmetry breaking, implemented to avoid the repeated evaluation of equivalent solutions. A preliminary computational experience confirms the effectiveness of the method.