complexity , the problem is an np-hard problem reducible to the knapsack problem . the problem can be formulated as an integer linear programming problem. contents illustration of one-dimensional cutting-stock problem bounds and checks solution classification cutting-stock problem in paper, film and metal...