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 2018
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. Computer Aided Systems Theory – EUROCAST 2017, Part I (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), 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.