Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging

Günther Raidl
Günther Raidl

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