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

Benedikt Klocker, Günther Raidl
January 2017
PDF bib

Abstract

Full Citation:

Benedikt Klocker, Günther R Raidl. Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging. Extended Abstracts of the Sixteenth International Conference on Computer Aided Systems Theory (EUROCAST 2017) (Alexis Quesada-Arencibia, José Carlos Rodríguez, Roberto Moreno-Díaz, eds.), pages 104–105, 2017.

Type
Conference Paper
Günther Raidl
Günther Raidl

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