An Optimal Algorithm for 1-D Cutting Stock Problem

Srikrishnan Divakaran

We present an $n{\Delta }^{O(k^2)}$ time algorithm to obtain an optimal solution for $1$-dimensional cutting stock problem: the bin packing problem of packing $n$ items onto unit capacity…