The problem

Gives a summary of the cutstock problem used in this tutorial.

This tutorial reuses the same problem and data as the cutstock_main example described in The cutting stock problem. The main problem consists of cutting big wooden boards into small shelves to meet customer demands while minimizing the number of boards used. The subproblem consists of finding the best new pattern to cut the roll. This is a simple knapsack problem. To solve it, you are going to use a dedicated algorithm implemented in Java (instead of CPLEX).