Gomory Cuts from a Position-Indexed Formulation of 1D Stock Cutting

Most integer programming problems can be formulated in several ways. Some formulations are better suited for solution by exact methods, because they have either (i) a strong LP relaxation, (ii) few symmetries in the solution space, or both. However, solving one formulation, we can often branch and/or add cutting planes which are implicitly based on variables of other formulations, working in fact on intersection of several polytopes. Traditional examples of this approach can be found in, e.g., (capacitated) routing and network planning where decomposed models operate with paths or trees, and thus need to be solved by column generation, but original models operate on separate edges. We consider such a ‘capacity-extended formulation’, the so-called arc-flow model, of the 1D cutting stock problem. Its variables are known to induce effective branching constraints leading to small and stable branch&bounsd trees. In this work we explore Chvátal-Gomory cuts on its variables. The results are positive only for small instances. Moreover, we compare the results to the cuts constructed on the variables of the direct model. The latter are more involved but also more effective.