I need to implement an algorithm in GH for the Cutting Stock problem. Well I think I do.

Algorithm folks will know this as a staple problem; similar to the classic knapsack one. It’s only 1D not 2D like template nesting but with the ‘normal’ cutting stock problem the lengths of stock are fixed and I need the algorithm to be able to handle stock of varying lengths.

From what I gather, the varying stock lengths means this no longer conforms to the cutting stock problem and instead falls under the domain of the bin packing problem and I have not found any pseudocode for this, only some scary looking maths in whitepapers.

Any suggestions ?