A branch-and-cut approach to the repetition-free longest common subsequence problem (2010)
Ferreira, Carlos Eduardo 
; Tjandraatmadja, Christian
Fonte: Electronic Notes in Discrete Mathematics. Nome do evento: International Symposium on Combinatorial Optimization - ISCO. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERREIRA, Carlos Eduardo e TJANDRAATMADJA, Christian. A branch-and-cut approach to the repetition-free longest common subsequence problem. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2010.05.067. Acesso em: 11 nov. 2025. , 2010APA
Ferreira, C. E., & Tjandraatmadja, C. (2010). A branch-and-cut approach to the repetition-free longest common subsequence problem. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2010.05.067NLM
Ferreira CE, Tjandraatmadja C. A branch-and-cut approach to the repetition-free longest common subsequence problem [Internet]. Electronic Notes in Discrete Mathematics. 2010 ; 36 527-534.[citado 2025 nov. 11 ] Available from: https://doi.org/10.1016/j.endm.2010.05.067Vancouver
Ferreira CE, Tjandraatmadja C. A branch-and-cut approach to the repetition-free longest common subsequence problem [Internet]. Electronic Notes in Discrete Mathematics. 2010 ; 36 527-534.[citado 2025 nov. 11 ] Available from: https://doi.org/10.1016/j.endm.2010.05.067
