ReP USP - Resultado da busca

Trabalho de evento
A polyhedral investigation of the LCS problem and a repetition-free variant (2008)
Fernandes, Cristina Gomes ; Ferreira, Carlos Eduardo ; Tjandraatmadja, Christian ; Wakabayashi, Yoshiko
Source: Proceedings. Conference titles: Latin American Symposium on Theoretical Informatics - LATIN. Unidade: IME
Subjects: PROGRAMAÇÃO DINÂMICA, PROGRAMAÇÃO INTEIRA E FLUXOS EM REDE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
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: 17 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_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 out. 17 ] 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 out. 17 ] Available from: https://doi.org/10.1007/978-3-540-78773-0_29
Artigo de periodico
Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation (2008)
Cintra, Glauber Ferreira ; Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko ; Xavier, Eduardo C
Source: European Journal of Operational Research. Unidades: IME, EACH
Subjects: PROGRAMAÇÃO DINÂMICA, ALGORITMOS, EMPACOTAMENTO E COBERTURA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CINTRA, Glauber Ferreira et al. Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation. European Journal of Operational Research, v. 191, n. 1, p. 61-85, 2008Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2007.08.007. Acesso em: 17 out. 2024.
APA
Cintra, G. F., Miyazawa, F. K., Wakabayashi, Y., & Xavier, E. C. (2008). Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation. European Journal of Operational Research, 191( 1), 61-85. doi:10.1016/j.ejor.2007.08.007
NLM
Cintra GF, Miyazawa FK, Wakabayashi Y, Xavier EC. Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation [Internet]. European Journal of Operational Research. 2008 ; 191( 1): 61-85.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.ejor.2007.08.007
Vancouver
Cintra GF, Miyazawa FK, Wakabayashi Y, Xavier EC. Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation [Internet]. European Journal of Operational Research. 2008 ; 191( 1): 61-85.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.ejor.2007.08.007
Trabalho de evento-anais periodico
Packing triangles in low degree graphs and indifference graphs (2008)
Manic, Gordana; Wakabayashi, Yoshiko
Source: Discrete Mathematics. Conference titles: European Conference on Combinatorics - EuroComb. Unidade: IME
Subjects: TEORIA DOS GRAFOS, ALGORITMOS DE APROXIMAÇÃO, EMPACOTAMENTO E COBERTURA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MANIC, Gordana e WAKABAYASHI, Yoshiko. Packing triangles in low degree graphs and indifference graphs. Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.disc.2007.07.100. Acesso em: 17 out. 2024. , 2008
APA
Manic, G., & Wakabayashi, Y. (2008). Packing triangles in low degree graphs and indifference graphs. Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.disc.2007.07.100
NLM
Manic G, Wakabayashi Y. Packing triangles in low degree graphs and indifference graphs [Internet]. Discrete Mathematics. 2008 ; 308( 8): 1455-1471.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.disc.2007.07.100
Vancouver
Manic G, Wakabayashi Y. Packing triangles in low degree graphs and indifference graphs [Internet]. Discrete Mathematics. 2008 ; 308( 8): 1455-1471.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.disc.2007.07.100
Parte de monografia/livro
Stochastic chains with memory in variable length (2008)
Galves, Antonio ; Löcherbach, Eva
Source: Festschrift in honor of Jorma Rissanen on the occasion of his 75th birthday. Unidade: IME
Assunto: CADEIAS DE MARKOV
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GALVES, Antonio e LÖCHERBACH, Eva. Stochastic chains with memory in variable length. Festschrift in honor of Jorma Rissanen on the occasion of his 75th birthday. Tradução . Tampere: Tampere International Center for Signal Processing, 2008. . . Acesso em: 17 out. 2024.
APA
Galves, A., & Löcherbach, E. (2008). Stochastic chains with memory in variable length. In Festschrift in honor of Jorma Rissanen on the occasion of his 75th birthday. Tampere: Tampere International Center for Signal Processing.
NLM
Galves A, Löcherbach E. Stochastic chains with memory in variable length. In: Festschrift in honor of Jorma Rissanen on the occasion of his 75th birthday. Tampere: Tampere International Center for Signal Processing; 2008. [citado 2024 out. 17 ]
Vancouver
Galves A, Löcherbach E. Stochastic chains with memory in variable length. In: Festschrift in honor of Jorma Rissanen on the occasion of his 75th birthday. Tampere: Tampere International Center for Signal Processing; 2008. [citado 2024 out. 17 ]

USP Schools

ReP

Filtros

Authors

USP affiliated authors

Subjects