A polyhedral investigation of the LCS problem and a repetition-free variant (2008)
Fonte: Proceedings. Nome do evento: Latin American Symposium on Theoretical Informatics - LATIN. Unidade: IME
Assuntos: PROGRAMAÇÃO DINÂMICA, PROGRAMAÇÃO INTEIRA E FLUXOS EM REDE
ABNT
FERNANDES, Cristina Gomes et al. A polyhedral investigation of the LCS problem and a repetition-free variant. 2008, Anais.. Berlin: Springer, 2008. Disponível em: https://doi.org/10.1007/978-3-540-78773-0_29. Acesso em: 06 out. 2024.APA
Fernandes, C. G., Ferreira, C. E., Tjandraatmadja, C., & Wakabayashi, Y. (2008). A polyhedral investigation of the LCS problem and a repetition-free variant. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-78773-0_29NLM
Fernandes CG, Ferreira CE, Tjandraatmadja C, Wakabayashi Y. A polyhedral investigation of the LCS problem and a repetition-free variant [Internet]. Proceedings. 2008 ;[citado 2024 out. 06 ] Available from: https://doi.org/10.1007/978-3-540-78773-0_29Vancouver
Fernandes CG, Ferreira CE, Tjandraatmadja C, Wakabayashi Y. A polyhedral investigation of the LCS problem and a repetition-free variant [Internet]. Proceedings. 2008 ;[citado 2024 out. 06 ] Available from: https://doi.org/10.1007/978-3-540-78773-0_29