Computational notes to the Gilmore-Gormory cutting stock algorithm

In this paper an extension and computational modifications of the Gilmore-Gomory cutting stock algorithm are presented so that constraints deriving from the practical circumstances of an industrial company can also be taken into account. A sample example of the one-dimensional problem of Gilmore and Gomory and that of the two-dimensional problem of Wang are solved, and their computational characteristics are being published. The computarization of the procedure has already been used by 12 industrial companies.