Cutting Stock Problem

Does anyone know how to implement the algorithm for this problem using the Knapsack algorithm?

The method I'm using at present makes extensive use of LINQ and Collections of Collections and a few Dictionaries. For those who dont know what I'm talking about check out The C开发者_如何学Pythonutting Stock Problem.

As mentioned in your given link, this problem is in fact an instance of an ILP, which is NP-hard normally.

Directly from wikipedia: Advanced algorithms for solving integer linear programs include:

• cutting-plane method
• branch and bound
• branch and cut