Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging (bibtex)
by
Reference:
Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution MergingBenedikt Klockerapr 2019, Master's thesis, TU Wien, Institute of Logic and Computation.Note: supervised by G. Raidl
Bibtex Entry:
@mastersthesis{klocker_19,
author = {Benedikt Klocker},
title = {Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging},
school = {TU Wien, Institute of Logic and Computation},
address = {Vienna, Austria},
month = apr,
year = {2019},
url = {https://www.ac.tuwien.ac.at/files/pub/klocker_19.pdf},
note = {supervised by G. Raidl},
keywords = {metaheuristic,scheduling},
}
Powered by bibtexbrowser