%0 Conference Paper %1 conf/cpaior/Vilim11 %A Vilím, Petr %B CPAIOR %D 2011 %E Achterberg, Tobias %E Beck, J. Christopher %I Springer %K dblp %P 230-245 %T Timetable Edge Finding Filtering Algorithm for Discrete Cumulative Resources. %U http://dblp.uni-trier.de/db/conf/cpaior/cpaior2011.html#Vilim11 %V 6697 %@ 978-3-642-21310-6

@inproceedings{conf/cpaior/Vilim11, added-at = {2017-05-17T00:00:00.000+0200}, author = {Vilím, Petr}, biburl = {https://www.bibsonomy.org/bibtex/25cabf9bc71c4b76a6528c8d46ce54fbd/dblp}, booktitle = {CPAIOR}, crossref = {conf/cpaior/2011}, editor = {Achterberg, Tobias and Beck, J. Christopher}, ee = {https://doi.org/10.1007/978-3-642-21311-3_22}, interhash = {ea4baeab1681cdbcaae01aa3698dfc87}, intrahash = {5cabf9bc71c4b76a6528c8d46ce54fbd}, isbn = {978-3-642-21310-6}, keywords = {dblp}, pages = {230-245}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T17:54:32.000+0200}, title = {Timetable Edge Finding Filtering Algorithm for Discrete Cumulative Resources.}, url = {http://dblp.uni-trier.de/db/conf/cpaior/cpaior2011.html#Vilim11}, volume = 6697, year = 2011 }