A branch-and-cut approach to the repetition-free longest common subsequence problem

Carlos Eduardo Ferreira, Christian Tjandraatmadja. A branch-and-cut approach to the repetition-free longest common subsequence problem. Electronic Notes in Discrete Mathematics, 36:527-534, 2010. [doi]

No reviews for this publication, yet.