Cutting

Column Generation at Strip Level for the k-Staged Two-Dimensional Cutting Stock Problem
March 2016, Master’s thesis, TU Wien, Institute of Computer Graphics and Algorithms.
Note: supervised by G. Raidl and F. Dusberger
PDF Cite
A Branch-and-Bound Approach for the Constrained k-Staged 2-Dimensional Cutting Stock Problem
January 2016, Master’s thesis, TU Wien, Institute of Computer Graphics and Algorithms.
Note: supervised by G. Raidl and F. Dusberger
PDF Cite
A Value-Correction Construction Heuristic for the Two-Dimensional Cutting Stock Problem with Variable Sheet Size
Extended Abstracts of the Fifthteenth International Conference on Computer Aided Systems Theory (EUROCAST 2015) (Alexis Quesada-Arencibia and José Carlos Rodriguez and Roberto Moreno-Díaz jr. and Roberto Moreno-D\áz), pages 109-110, 2015.
PDF Cite
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.
PDF Cite
A Variable Neighborhood Search Using Very Large Neighborhood Structures for the 3-Staged 2-Dimensional Cutting Stock Problem
Hybrid Metaheuristics, 9th Int. Workshop, HM 2014 (Maria J. Blesa and Christain Blum and Stefan Voß), volume 8457 of LNCS, pages 85-99, 2014, Springer.
PDF Cite