Recursive Computational Procedure for Two-dimensional Stock Cutting

A recursive algorithm is implemented to give high computational speeds in the solution of a cutting-stock problem. Optimal edge-to-edge cutting is shown to be achieved more easily by recursive programming than by conventional methods. The technique features preliminary discretization, which lowers the memory requirements in the computational procedure. A comparison is made between this recursive algorithm and two iterative algorithms previously given by Gilmore-Gomory. The limitations of the algorithms are discussed and some numerical results given.