Facet-defining inequalities for the cutting stock problem

In this paper the polyhedron of the cutting stock problem is investigated with respect to facet-defining inequalities. For some classes of valid inequalities this property is proved. First results of computational experiments show the effectiveness of applying these valid inequalities for strengthening lower bounds. Especially in case of instances not fulfilling the Integer Round-Up Property the usage of cutting planes can prove the optimality of solutions found by heuristics.