Cutting stock problems have been deeply investigated in the last thirty years due to their wide range of applications as well as to their nice structure. The one dimensional problem (CSP) consists in cutting out of the minumum number of standard lengths the required number of pieces for each demand length. An ILP formulation, known as the multicut model, where there is a variable for each feasible way of cutting a standard length and a constraint for each demand length, has been the model of reference since the column generation problem was formulated as a knapsack in 1965 by Gilmore and Gomory. Further investigations studied the gap between the multicut model objective function and its linear relaxation [11], which gave theorical foundations to the many rounding heuristics for the standard case, while a remarkable number of heuristics have been proposed to tackle particular cases arising in production processes. Nevertheless, the problem structure has never been exploited in order to ..
