A polyhedral investigation of the LCS problem and a repetition-free variant (2008)
- Authors:
- USP affiliated authors: FERNANDES, CRISTINA GOMES - IME ; FERREIRA, CARLOS EDUARDO - IME ; WAKABAYASHI, YOSHIKO - IME ; TJANDRAATMADJA, CHRISTIAN - IME
- Unidade: IME
- DOI: 10.1007/978-3-540-78773-0_29
- Subjects: PROGRAMAÇÃO DINÂMICA; PROGRAMAÇÃO INTEIRA E FLUXOS EM REDE
- Keywords: Separation Problem; Perfect Graph; Integer Programming Formulation; Alphabet Size
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: Proceedings
- Conference titles: Latin American Symposium on Theoretical Informatics - LATIN
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
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: 18 abr. 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_29 -
NLM
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 abr. 18 ] Available from: https://doi.org/10.1007/978-3-540-78773-0_29 -
Vancouver
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 abr. 18 ] Available from: https://doi.org/10.1007/978-3-540-78773-0_29 - Repetition-free longest common subsequence
- Repetition-free longest common subsequence
- Selfish square packing
- Prices of anarchy of selfish 2D bin packing games
- A branch-and-cut approach to the repetition-free longest common subsequence problem
- The envy-free pricing problem and unit-demand markets
- The envy-free pricing problem, unit-demand markets and connections with the network pricing problem
- Anais da primeira oficina nacional em problemas combinatórios: teoria, algoritmos e aplicações
- Rearrangement of DNA fragments: a branch and cut algorithm
- Approximating a class of combinatorial problems with rational objective function
Informações sobre o DOI: 10.1007/978-3-540-78773-0_29 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
