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: 11 nov. 2025.
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 2025 nov. 11 ] 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 2025 nov. 11 ] Available from: https://doi.org/10.1007/s10107-015-0880-7
Artigo de periodico
Packing in generalized kernel systems: a framework that generalizes packing of branchings (2015)
Leston Rey, Mario; Wakabayashi, Yoshiko
Source: Mathematical Programming. Unidade: IME
Subjects: OTIMIZAÇÃO COMBINATÓRIA, EMPACOTAMENTO E COBERTURA, MATEMÁTICA DA COMPUTAÇÃO, COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
LESTON REY, Mario e WAKABAYASHI, Yoshiko. Packing in generalized kernel systems: a framework that generalizes packing of branchings. Mathematical Programming, v. 149, n. 1-2, p. 209-251, 2015Tradução . . Disponível em: https://doi.org/10.1007/s10107-014-0746-4. Acesso em: 11 nov. 2025.
APA
Leston Rey, M., & Wakabayashi, Y. (2015). Packing in generalized kernel systems: a framework that generalizes packing of branchings. Mathematical Programming, 149( 1-2), 209-251. doi:10.1007/s10107-014-0746-4
NLM
Leston Rey M, Wakabayashi Y. Packing in generalized kernel systems: a framework that generalizes packing of branchings [Internet]. Mathematical Programming. 2015 ; 149( 1-2): 209-251.[citado 2025 nov. 11 ] Available from: https://doi.org/10.1007/s10107-014-0746-4
Vancouver
Leston Rey M, Wakabayashi Y. Packing in generalized kernel systems: a framework that generalizes packing of branchings [Internet]. Mathematical Programming. 2015 ; 149( 1-2): 209-251.[citado 2025 nov. 11 ] Available from: https://doi.org/10.1007/s10107-014-0746-4
Artigo de periodico
Approximating a class of combinatorial problems with rational objective function (2010)
Correa, J. R.; Fernandes, Cristina Gomes ; Wakabayashi, Yoshiko
Source: Mathematical Programming. Unidade: IME
Assunto: OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CORREA, J. R. e FERNANDES, Cristina Gomes e WAKABAYASHI, Yoshiko. Approximating a class of combinatorial problems with rational objective function. Mathematical Programming, v. 124, n. 1-2, p. 255-269, 2010Tradução . . Disponível em: https://doi.org/10.1007/s10107-010-0364-8. Acesso em: 11 nov. 2025.
APA
Correa, J. R., Fernandes, C. G., & Wakabayashi, Y. (2010). Approximating a class of combinatorial problems with rational objective function. Mathematical Programming, 124( 1-2), 255-269. doi:10.1007/s10107-010-0364-8
NLM
Correa JR, Fernandes CG, Wakabayashi Y. Approximating a class of combinatorial problems with rational objective function [Internet]. Mathematical Programming. 2010 ; 124( 1-2): 255-269.[citado 2025 nov. 11 ] Available from: https://doi.org/10.1007/s10107-010-0364-8
Vancouver
Correa JR, Fernandes CG, Wakabayashi Y. Approximating a class of combinatorial problems with rational objective function [Internet]. Mathematical Programming. 2010 ; 124( 1-2): 255-269.[citado 2025 nov. 11 ] Available from: https://doi.org/10.1007/s10107-010-0364-8
Artigo de periodico
Facets of the clique partitioning polytope (1990)
Grotschel, M; Wakabayashi, Yoshiko
Source: Mathematical Programming. Unidade: IME
Assunto: COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GROTSCHEL, M e WAKABAYASHI, Yoshiko. Facets of the clique partitioning polytope. Mathematical Programming, v. 47, n. 3 , p. 367-387, 1990Tradução . . Disponível em: https://doi.org/10.1007/BF01580870. Acesso em: 11 nov. 2025.
APA
Grotschel, M., & Wakabayashi, Y. (1990). Facets of the clique partitioning polytope. Mathematical Programming, 47( 3 ), 367-387. doi:10.1007/BF01580870
NLM
Grotschel M, Wakabayashi Y. Facets of the clique partitioning polytope [Internet]. Mathematical Programming. 1990 ; 47( 3 ): 367-387.[citado 2025 nov. 11 ] Available from: https://doi.org/10.1007/BF01580870
Vancouver
Grotschel M, Wakabayashi Y. Facets of the clique partitioning polytope [Internet]. Mathematical Programming. 1990 ; 47( 3 ): 367-387.[citado 2025 nov. 11 ] Available from: https://doi.org/10.1007/BF01580870
Artigo de periodico
A cutting plane algorithm for a clustering problem (1989)
Grotschel, M; Wakabayashi, Yoshiko
Source: Mathematical Programming. Unidade: IME
Assunto: OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GROTSCHEL, M e WAKABAYASHI, Yoshiko. A cutting plane algorithm for a clustering problem. Mathematical Programming, v. 45, n. 1 , p. 59-96, 1989Tradução . . Disponível em: https://doi.org/10.1007/BF01589097. Acesso em: 11 nov. 2025.
APA
Grotschel, M., & Wakabayashi, Y. (1989). A cutting plane algorithm for a clustering problem. Mathematical Programming, 45( 1 ), 59-96. doi:10.1007/BF01589097
NLM
Grotschel M, Wakabayashi Y. A cutting plane algorithm for a clustering problem [Internet]. Mathematical Programming. 1989 ; 45( 1 ): 59-96.[citado 2025 nov. 11 ] Available from: https://doi.org/10.1007/BF01589097
Vancouver
Grotschel M, Wakabayashi Y. A cutting plane algorithm for a clustering problem [Internet]. Mathematical Programming. 1989 ; 45( 1 ): 59-96.[citado 2025 nov. 11 ] Available from: https://doi.org/10.1007/BF01589097

USP Schools

ReP

Filtros

Authors

Subjects

Indexado em