Christian Blum, Maria J. Blesa. Construct, Merge, Solve and Adapt: Application to the Repetition-Free Longest Common Subsequence Problem. In Francisco Chicano, Bin Hu, Pablo García-Sánchez, editors, Evolutionary Computation in Combinatorial Optimization - 16th European Conference, EvoCOP 2016, Porto, Portugal, March 30 - April 1, 2016, Proceedings. Volume 9595 of Lecture Notes in Computer Science, pages 46-57, Springer, 2016. [doi]
@inproceedings{BlumB16,
title = {Construct, Merge, Solve and Adapt: Application to the Repetition-Free Longest Common Subsequence Problem},
author = {Christian Blum and Maria J. Blesa},
year = {2016},
doi = {10.1007/978-3-319-30698-8_4},
url = {http://dx.doi.org/10.1007/978-3-319-30698-8_4},
researchr = {https://researchr.org/publication/BlumB16},
cites = {0},
citedby = {0},
pages = {46-57},
booktitle = {Evolutionary Computation in Combinatorial Optimization - 16th European Conference, EvoCOP 2016, Porto, Portugal, March 30 - April 1, 2016, Proceedings},
editor = {Francisco Chicano and Bin Hu and Pablo García-Sánchez},
volume = {9595},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-319-30697-1},
}