An A* Algorithm for Solving a Prize-Collecting Sequencing Problem with One Common and Multiple Secondary Resources and Time Windows (bibtex)
by , ,
Reference:
An A* Algorithm for Solving a Prize-Collecting Sequencing Problem with One Common and Multiple Secondary Resources and Time WindowsMatthias Horn, Günther R. Raidl, Elina RönnbergPATAT 2018: Proceedings of the 12th International Conference of the Practice and Theory of Automated Timetabling, pages 235–256, 2018.
Bibtex Entry:
@inproceedings{horn:2018,
author = {Matthias Horn and G{\"{u}}nther R. Raidl and Elina R{\"{o}}nnberg},
title = {An {A*} Algorithm for Solving a Prize-Collecting Sequencing Problem with One Common and Multiple Secondary Resources and Time Windows},
booktitle = {PATAT 2018: Proceedings of the 12th International Conference of the Practice and Theory of Automated Timetabling},
year = {2018},
pages = {235--256},
address = {Vienna, Austria},
}
Powered by bibtexbrowser