ReP USP - Resultado da busca

Artigo de periodico
Near-perfect clique-factors in sparse pseudorandom graphs (2021)
Han, Jie ; Kohayakawa, Yoshiharu ; Person, Yury
Source: Combinatorics, Probability & Computing. Unidade: IME
Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA PROBABILÍSTICA, PROGRAMAÇÃO MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HAN, Jie e KOHAYAKAWA, Yoshiharu e PERSON, Yury. Near-perfect clique-factors in sparse pseudorandom graphs. Combinatorics, Probability & Computing, v. 30, n. 4, p. 570-590, 2021Tradução . . Disponível em: https://doi.org/10.1017/S0963548320000577. Acesso em: 07 nov. 2025.
APA
Han, J., Kohayakawa, Y., & Person, Y. (2021). Near-perfect clique-factors in sparse pseudorandom graphs. Combinatorics, Probability & Computing, 30( 4), 570-590. doi:10.1017/S0963548320000577
NLM
Han J, Kohayakawa Y, Person Y. Near-perfect clique-factors in sparse pseudorandom graphs [Internet]. Combinatorics, Probability & Computing. 2021 ; 30( 4): 570-590.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1017/S0963548320000577
Vancouver
Han J, Kohayakawa Y, Person Y. Near-perfect clique-factors in sparse pseudorandom graphs [Internet]. Combinatorics, Probability & Computing. 2021 ; 30( 4): 570-590.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1017/S0963548320000577
Artigo de periodico
New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry (2017)
Dostert, Maria ; Guzmán, Cristóbal ; Oliveira Filho, Fernando Mário de; Vallentin, Frank
Source: Discrete & Computational Geometry. Unidade: IME
Subjects: MATEMÁTICA DISCRETA, PROGRAMAÇÃO MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DOSTERT, Maria et al. New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry. Discrete & Computational Geometry, v. 58, n. 2, p. 449-481, 2017Tradução . . Disponível em: https://doi.org/10.1007/s00454-017-9882-y. Acesso em: 07 nov. 2025.
APA
Dostert, M., Guzmán, C., Oliveira Filho, F. M. de, & Vallentin, F. (2017). New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry. Discrete & Computational Geometry, 58( 2), 449-481. doi:10.1007/s00454-017-9882-y
NLM
Dostert M, Guzmán C, Oliveira Filho FM de, Vallentin F. New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry [Internet]. Discrete & Computational Geometry. 2017 ; 58( 2): 449-481.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1007/s00454-017-9882-y
Vancouver
Dostert M, Guzmán C, Oliveira Filho FM de, Vallentin F. New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry [Internet]. Discrete & Computational Geometry. 2017 ; 58( 2): 449-481.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1007/s00454-017-9882-y
Artigo de periodico
On the constrained error bound condition and the projected Levenberg–Marquardt method (2017)
Behling, Roger; Fischer, Andreas; Haeser, Gabriel ; Ramos, A; Schönefeld, Klaus
Source: Optimization. Unidade: IME
Subjects: OTIMIZAÇÃO NÃO LINEAR, PROGRAMAÇÃO MATEMÁTICA, ANÁLISE NUMÉRICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BEHLING, Roger et al. On the constrained error bound condition and the projected Levenberg–Marquardt method. Optimization, v. 66, n. 8, p. 1397-1411, 2017Tradução . . Disponível em: https://doi.org/10.1080/02331934.2016.1200578. Acesso em: 07 nov. 2025.
APA
Behling, R., Fischer, A., Haeser, G., Ramos, A., & Schönefeld, K. (2017). On the constrained error bound condition and the projected Levenberg–Marquardt method. Optimization, 66( 8), 1397-1411. doi:10.1080/02331934.2016.1200578
NLM
Behling R, Fischer A, Haeser G, Ramos A, Schönefeld K. On the constrained error bound condition and the projected Levenberg–Marquardt method [Internet]. Optimization. 2017 ; 66( 8): 1397-1411.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1080/02331934.2016.1200578
Vancouver
Behling R, Fischer A, Haeser G, Ramos A, Schönefeld K. On the constrained error bound condition and the projected Levenberg–Marquardt method [Internet]. Optimization. 2017 ; 66( 8): 1397-1411.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1080/02331934.2016.1200578
Artigo de periodico
Upper bounds for packings of spheres of several radii (2014)
De Laat, David; Oliveira Filho, Fernando Mário de; Vallentin, Frank
Source: Forum of Mathematics, Sigma. Unidade: IME
Subjects: GEOMETRIA DIFERENCIAL, GEOMETRIA COMPUTACIONAL, PROGRAMAÇÃO MATEMÁTICA, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DE LAAT, David e OLIVEIRA FILHO, Fernando Mário de e VALLENTIN, Frank. Upper bounds for packings of spheres of several radii. Forum of Mathematics, Sigma, v. 2, p. 42 , 2014Tradução . . Disponível em: https://doi.org/10.1017/fms.2014.24. Acesso em: 07 nov. 2025.
APA
De Laat, D., Oliveira Filho, F. M. de, & Vallentin, F. (2014). Upper bounds for packings of spheres of several radii. Forum of Mathematics, Sigma, 2, 42 . doi:10.1017/fms.2014.24
NLM
De Laat D, Oliveira Filho FM de, Vallentin F. Upper bounds for packings of spheres of several radii [Internet]. Forum of Mathematics, Sigma. 2014 ; 2 42 .[citado 2025 nov. 07 ] Available from: https://doi.org/10.1017/fms.2014.24
Vancouver
De Laat D, Oliveira Filho FM de, Vallentin F. Upper bounds for packings of spheres of several radii [Internet]. Forum of Mathematics, Sigma. 2014 ; 2 42 .[citado 2025 nov. 07 ] Available from: https://doi.org/10.1017/fms.2014.24
Artigo de periodico
The node capacitated graph partitioning problem: a computational study (1998)
Ferreira, Carlos Eduardo ; Martin, A; de Souza, C. C.; Weismantel, R; Wolsey, L. A.
Source: Mathematical Programming. Unidade: IME
Subjects: PESQUISA OPERACIONAL, PROGRAMAÇÃO MATEMÁTICA, COMBINATÓRIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERREIRA, Carlos Eduardo et al. The node capacitated graph partitioning problem: a computational study. Mathematical Programming, v. 81, n. 2, p. 229-256, 1998Tradução . . Disponível em: https://doi.org/10.1007/bf01581107. Acesso em: 07 nov. 2025.
APA
Ferreira, C. E., Martin, A., de Souza, C. C., Weismantel, R., & Wolsey, L. A. (1998). The node capacitated graph partitioning problem: a computational study. Mathematical Programming, 81( 2), 229-256. doi:10.1007/bf01581107
NLM
Ferreira CE, Martin A, de Souza CC, Weismantel R, Wolsey LA. The node capacitated graph partitioning problem: a computational study [Internet]. Mathematical Programming. 1998 ; 81( 2): 229-256.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1007/bf01581107
Vancouver
Ferreira CE, Martin A, de Souza CC, Weismantel R, Wolsey LA. The node capacitated graph partitioning problem: a computational study [Internet]. Mathematical Programming. 1998 ; 81( 2): 229-256.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1007/bf01581107
Artigo de periodico
Formulations and valid inequalities for the node capacitated graph partitioning problem (1996)
Ferreira, Carlos Eduardo ; Martin, A.; Souza, C. C. de; Weismantel, Robert; Wolsey, Laurence A
Source: Mathematical Programming. Unidade: IME
Subjects: PESQUISA OPERACIONAL, PROGRAMAÇÃO MATEMÁTICA, COMBINATÓRIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERREIRA, Carlos Eduardo et al. Formulations and valid inequalities for the node capacitated graph partitioning problem. Mathematical Programming, v. 74, n. 3, p. 247-266, 1996Tradução . . Disponível em: https://doi.org/10.1007/bf02592198. Acesso em: 07 nov. 2025.
APA
Ferreira, C. E., Martin, A., Souza, C. C. de, Weismantel, R., & Wolsey, L. A. (1996). Formulations and valid inequalities for the node capacitated graph partitioning problem. Mathematical Programming, 74( 3), 247-266. doi:10.1007/bf02592198
NLM
Ferreira CE, Martin A, Souza CC de, Weismantel R, Wolsey LA. Formulations and valid inequalities for the node capacitated graph partitioning problem [Internet]. Mathematical Programming. 1996 ; 74( 3): 247-266.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1007/bf02592198
Vancouver
Ferreira CE, Martin A, Souza CC de, Weismantel R, Wolsey LA. Formulations and valid inequalities for the node capacitated graph partitioning problem [Internet]. Mathematical Programming. 1996 ; 74( 3): 247-266.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1007/bf02592198
Artigo de periodico
Solving multiple knapsack problems by cutting planes (1996)
Ferreira, Carlos Eduardo ; Martin, A.; Weismantel, Robert
Source: SIAM Journal on Optimization. Unidade: IME
Subjects: PESQUISA OPERACIONAL, PROGRAMAÇÃO MATEMÁTICA, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERREIRA, Carlos Eduardo e MARTIN, A. e WEISMANTEL, Robert. Solving multiple knapsack problems by cutting planes. SIAM Journal on Optimization, v. 6, n. 3, p. 858-877, 1996Tradução . . Disponível em: https://doi.org/10.1137/s1052623493254455. Acesso em: 07 nov. 2025.
APA
Ferreira, C. E., Martin, A., & Weismantel, R. (1996). Solving multiple knapsack problems by cutting planes. SIAM Journal on Optimization, 6( 3), 858-877. doi:10.1137/s1052623493254455
NLM
Ferreira CE, Martin A, Weismantel R. Solving multiple knapsack problems by cutting planes [Internet]. SIAM Journal on Optimization. 1996 ; 6( 3): 858-877.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1137/s1052623493254455
Vancouver
Ferreira CE, Martin A, Weismantel R. Solving multiple knapsack problems by cutting planes [Internet]. SIAM Journal on Optimization. 1996 ; 6( 3): 858-877.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1137/s1052623493254455
Relatorio tecnico
On the complexity of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets (1978)
Grötschel, Martin ; Wakabayashi, Yoshiko
Unidade: IME
Assunto: PROGRAMAÇÃO MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GRÖTSCHEL, Martin e WAKABAYASHI, Yoshiko. On the complexity of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/f1f748a0-4c1d-4d6b-bbc2-9607127d307b/316591.pdf. Acesso em: 07 nov. 2025. , 1978
APA
Grötschel, M., & Wakabayashi, Y. (1978). On the complexity of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/f1f748a0-4c1d-4d6b-bbc2-9607127d307b/316591.pdf
NLM
Grötschel M, Wakabayashi Y. On the complexity of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets [Internet]. 1978 ;[citado 2025 nov. 07 ] Available from: https://repositorio.usp.br/directbitstream/f1f748a0-4c1d-4d6b-bbc2-9607127d307b/316591.pdf
Vancouver
Grötschel M, Wakabayashi Y. On the complexity of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets [Internet]. 1978 ;[citado 2025 nov. 07 ] Available from: https://repositorio.usp.br/directbitstream/f1f748a0-4c1d-4d6b-bbc2-9607127d307b/316591.pdf

USP Schools

ReP

Filtros

Authors

Date published

Subjects

Source title

Funding Agencies

Non normalized affiliation