ReP USP - Resultado da busca

Artigo de periodico
The convex recoloring problem: polyhedra, facets and computational experiments (2016)
Campêlo, Manoel; Freire, Alexandre S; Lima, Karla Roberta Pereira Sampaio; Moura, Phablo Fernando Soares; Wakabayashi, Yoshiko
Source: Mathematical Programming. Unidades: EACH, IME
Subjects: ALGORITMOS, POLIEDROS, PROGRAMAÇÃO INTEIRA E FLUXOS EM REDE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CAMPÊLO, Manoel et al. The convex recoloring problem: polyhedra, facets and computational experiments. Mathematical Programming, v. 156, n. 1, p. 303-330, 2016Tradução . . Disponível em: https://doi.org/10.1007/s10107-015-0880-7. Acesso em: 08 out. 2024.
APA
Campêlo, M., Freire, A. S., Lima, K. R. P. S., Moura, P. F. S., & Wakabayashi, Y. (2016). The convex recoloring problem: polyhedra, facets and computational experiments. Mathematical Programming, 156( 1), 303-330. doi:10.1007/s10107-015-0880-7
NLM
Campêlo M, Freire AS, Lima KRPS, Moura PFS, Wakabayashi Y. The convex recoloring problem: polyhedra, facets and computational experiments [Internet]. Mathematical Programming. 2016 ; 156( 1): 303-330.[citado 2024 out. 08 ] Available from: https://doi.org/10.1007/s10107-015-0880-7
Vancouver
Campêlo M, Freire AS, Lima KRPS, Moura PFS, Wakabayashi Y. The convex recoloring problem: polyhedra, facets and computational experiments [Internet]. Mathematical Programming. 2016 ; 156( 1): 303-330.[citado 2024 out. 08 ] Available from: https://doi.org/10.1007/s10107-015-0880-7
Artigo de periodico
Hardness and inapproximability of convex recoloring problems (2014)
Campêlo, Manoel; Huiban, Cristiana Gomes; Sampaio, Rudini Menezes; Wakabayashi, Yoshiko
Source: Theoretical Computer Science. Unidade: IME
Subjects: OTIMIZAÇÃO COMBINATÓRIA, TEORIA DOS GRAFOS, ANÁLISE DE ALGORITMOS, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CAMPÊLO, Manoel et al. Hardness and inapproximability of convex recoloring problems. Theoretical Computer Science, v. 533, p. 15-25, 2014Tradução . . Disponível em: https://doi.org/10.1016/j.tcs.2014.03.017. Acesso em: 08 out. 2024.
APA
Campêlo, M., Huiban, C. G., Sampaio, R. M., & Wakabayashi, Y. (2014). Hardness and inapproximability of convex recoloring problems. Theoretical Computer Science, 533, 15-25. doi:10.1016/j.tcs.2014.03.017
NLM
Campêlo M, Huiban CG, Sampaio RM, Wakabayashi Y. Hardness and inapproximability of convex recoloring problems [Internet]. Theoretical Computer Science. 2014 ; 533 15-25.[citado 2024 out. 08 ] Available from: https://doi.org/10.1016/j.tcs.2014.03.017
Vancouver
Campêlo M, Huiban CG, Sampaio RM, Wakabayashi Y. Hardness and inapproximability of convex recoloring problems [Internet]. Theoretical Computer Science. 2014 ; 533 15-25.[citado 2024 out. 08 ] Available from: https://doi.org/10.1016/j.tcs.2014.03.017
Trabalho de evento-anais periodico
Polyhedral studies on the convex recoloring problem (2013)
Campêlo, Manoel; Lima, Karla Roberta Pereira Sampaio; Moura, Phablo Fernando Soares; Wakabayashi, Yoshiko
Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin-American Algorithms, Graphs, and Optimization Symposium - LAGOS. Unidades: EACH, IME
Subjects: ALGORITMOS, POLIEDROS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CAMPÊLO, Manoel et al. Polyhedral studies on the convex recoloring problem. Electronic Notes in Discrete Mathematics. Amsterdam: Escola de Artes, Ciências e Humanidades, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2013.10.036. Acesso em: 08 out. 2024. , 2013
APA
Campêlo, M., Lima, K. R. P. S., Moura, P. F. S., & Wakabayashi, Y. (2013). Polyhedral studies on the convex recoloring problem. Electronic Notes in Discrete Mathematics. Amsterdam: Escola de Artes, Ciências e Humanidades, Universidade de São Paulo. doi:10.1016/j.endm.2013.10.036
NLM
Campêlo M, Lima KRPS, Moura PFS, Wakabayashi Y. Polyhedral studies on the convex recoloring problem [Internet]. Electronic Notes in Discrete Mathematics. 2013 ; no 2013 233-238.[citado 2024 out. 08 ] Available from: https://doi.org/10.1016/j.endm.2013.10.036
Vancouver
Campêlo M, Lima KRPS, Moura PFS, Wakabayashi Y. Polyhedral studies on the convex recoloring problem [Internet]. Electronic Notes in Discrete Mathematics. 2013 ; no 2013 233-238.[citado 2024 out. 08 ] Available from: https://doi.org/10.1016/j.endm.2013.10.036

USP Schools

ReP

Filtros

Authors

Subjects

Indexado em