Team
Research
Courses
News
Jobs
Contact
Internal
Light
Dark
Automatic
Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging
Klocker, Benedikt
,
Günther Raidl
January 2018
PDF
Cite
Type
Conference Paper
PILOT
Beam Search
Cutting Stock Problem
Discrete Optimization
Solution Merging
Günther Raidl
Günther Raidl is a Professor at the Algorithms and Complexity Group.
Cite
×