A note on modifying a two-dimensional trim-loss algorithm to deal with cutting restrictions

Restrictions upon the placement and number of cuts can arise in a two-dimensional trim-loss problem. It is shown how to modify the two or three-stage algorithms of Gilmore and Gomory to deal with such restrictions. Computational experience shows the modified procedures are viable in a practical application although an optimal solution can no longer be guaranteed.