This is a preview. Log in through your library . Abstract A heuristic algorithm employing dynamic programming is presented for solving the two-dimensional cutting stock problem where all the small ...