This paper introduces the n-nested one-dimensional cutting stock problem which occurs in a number of significant industrial processes and gives rise to difficult inter-connected cutting problems. It provides some reductions, some characterisations which allow decomposition, and some procedures which give advanced start solutions suitable for application in linear programming approximations to these problems.
