Solving the 3-Staged 2-Dimensional Cutting Stock Problem by Dynamic Programming and Variable Neighborhood Search

Frederico Dusberger, Günther Raidl
January 2015
PDF bib

Abstract

Full Citation:

Frederico Dusberger, Günther R. Raidl. Solving the 3-Staged 2-Dimensional Cutting Stock Problem by Dynamic Programming and Variable Neighborhood Search. The 3rd International Conference on Variable Neighborhood Search (VNS'14), volume 47 of Electronic Notes in Discrete Mathematics, pages 133–140, 2015, Elsevier.

Type
Conference Paper
Cutting
Günther Raidl
Günther Raidl

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