Introduction - If you have any usage issues, please Google them yourself
This program will try to find optimal solutions for what is commonly known as the 1-dimensional Cutting Stock Problem, The Cutting Stock problem requires that we find the best (cheapest) way to cut one-dimensional stock pieces (pipe, dimensional lumber, wire, rolls of paper or other sheet material to be slit, etc.) in such a way that a given number of pieces of specified lengths or widths are created.