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 bib

Abstract

Full Citation:

Klocker, Benedikt, Raidl, Günther R. Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging. Computer Aided Systems Theory – EUROCAST 2017, Part I (Moreno-D'iaz, Roberto and Pichler, Franz and Quesada-Arencibia, Alexis), volume 10671 of LNCS, pages 355-363, 2018, Springer.

Type
Conference Paper
PILOT Beam Search Cutting Stock Problem Discrete Optimization Solution Merging
Günther Raidl
Günther Raidl

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