Solving the 3-Staged 2-Dimensional Cutting Stock Problem by Dynamic Programming and Variable Neighborhood Search

Günther Raidl
Günther Raidl

Günther Raidl is a Professor at the Algorithms and Complexity Group.