Beam-ACO for the Repetition-Free Longest Common Subsequence Problem

Christian Blum, Maria J. Blesa, Borja Calvo. Beam-ACO for the Repetition-Free Longest Common Subsequence Problem. In Pierrick Legrand, Marc-Michel Corsini, Jin-Kao Hao, Nicolas Monmarché, Evelyne Lutton, Marc Schoenauer, editors, Artificial Evolution - 11th International Conference, Evolution Artificielle, EA 2013, Bordeaux, France, October 21-23, 2013. Revised Selected Papers. Volume 8752 of Lecture Notes in Computer Science, pages 79-90, Springer, 2013. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.