A heuristic algorithm employing dynamic programming is presented for solving the two-dimensional cutting stock problem where all the small rectangles are of the same dimensions, but without the usual restriction that the cutting be done with "guillotine" cuts, i.e., cut which must be made in...