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

Carlos Eduardo Ferreira Christian Tjandraatmadja; International Symposium on Combinatorial Optimization - ISCO (2010 Hammamet)

Electronic Notes in Discrete Mathematics Amsterdam v. 36, p. 527-534, 2010

Amsterdam 2010

Localização: IME - Inst. Matemática e Estatística    (PROD-2175800 ) e outros locais(Acessar)