%0 Conference Paper %1 conf/ae/BlumBC13 %A Blum, Christian %A Blesa, Maria J. %A Calvo, Borja %B Artificial Evolution %D 2013 %E Legrand, Pierrick %E Corsini, Marc-Michel %E Hao, Jin-Kao %E Monmarché, Nicolas %E Lutton, Evelyne %E Schoenauer, Marc %I Springer %K dblp %P 79-90 %T Beam-ACO for the Repetition-Free Longest Common Subsequence Problem. %U http://dblp.uni-trier.de/db/conf/ae/ae2013.html#BlumBC13 %V 8752 %@ 978-3-319-11682-2

@inproceedings{conf/ae/BlumBC13, added-at = {2019-06-02T00:00:00.000+0200}, author = {Blum, Christian and Blesa, Maria J. and Calvo, Borja}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/22ec49a7580a7ef87ef2cbd2f20740f88/dblp}, booktitle = {Artificial Evolution}, crossref = {conf/ae/2013}, editor = {Legrand, Pierrick and Corsini, Marc-Michel and Hao, Jin-Kao and Monmarché, Nicolas and Lutton, Evelyne and Schoenauer, Marc}, ee = {https://www.wikidata.org/entity/Q62672277}, interhash = {eb25082441b6a3d452ccef123964daf5}, intrahash = {2ec49a7580a7ef87ef2cbd2f20740f88}, isbn = {978-3-319-11682-2}, keywords = {dblp}, pages = {79-90}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-09-27T18:00:48.000+0200}, title = {Beam-ACO for the Repetition-Free Longest Common Subsequence Problem.}, url = {http://dblp.uni-trier.de/db/conf/ae/ae2013.html#BlumBC13}, volume = 8752, year = 2013 }