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

Available online at Electronic Notes in Discrete Mathematics 47 (2015) 133–140 /locate/endm Solving the 3-Staged 2-Dimensional Cutting Stock Problem by Dynamic Programming and Variable Neighborhood Search Frederico Dusberger 1 G¨unther R. Raidl 2 Institute of Computer Graphics and Algorithms, Vienna University of Technology, Vienna Austria Abstract We present a variable neighborhood search (VNS) for the 3-staged 2-dimensional cutting stoc