Solving the 3-Staged 2-Dimensional Cutting Stock Problem by Dynamic Programming and Variable Neighborhood Search (bibtex)
by ,
Reference:
Solving the 3-Staged 2-Dimensional Cutting Stock Problem by Dynamic Programming and Variable Neighborhood SearchFrederico Dusberger, Günther R. RaidlThe 3rd International Conference on Variable Neighborhood Search (VNS'14), volume 47 of Electronic Notes in Discrete Mathematics, pages 133–140, 2015, Elsevier.
Bibtex Entry:
@inproceedings{dusberger-14b,
author = {Frederico Dusberger and G{\"u}nther R. Raidl},
title = {Solving the 3-Staged 2-Dimensional Cutting Stock Problem by Dynamic Programming and Variable Neighborhood Search},
booktitle = {{The 3rd International Conference on Variable Neighborhood Search (VNS'14)}},
series = {Electronic Notes in Discrete Mathematics},
publisher = {Elsevier},
year = {2015},
volume = {47},
pages = {133--140},
keywords = {cutting},
url = {https://www.ac.tuwien.ac.at/files/pub/dusberger_14b.pdf},
}