The problem with a sharp stock

Question

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

The method I am currently using makes extensive use of LINQ and collection collections and several dictionaries. For those who do not know what I'm talking about checking the problem of cutting.

Answer 1

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

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

• plane plane method
• branching and snapping
• branch and cut