ReP USP - Resultado da busca

Artigo de periodico
A primal-dual extension of the Goemans-Williamson algorithm for the weighted fractional cut-covering problem (2025)
Proença, Nathan Benedetto ; Silva, Marcel Kenji de Carli ; Sato, Cristiane Maria ; Tunçel, Levent
Source: Mathematical Programming. Unidade: IME
Assunto: COMPUTAÇÃO APLICADA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
PROENÇA, Nathan Benedetto et al. A primal-dual extension of the Goemans-Williamson algorithm for the weighted fractional cut-covering problem. Mathematical Programming, 2025Tradução . . Disponível em: https://doi.org/10.1007/s10107-025-02209-0. Acesso em: 19 nov. 2025.
APA
Proença, N. B., Silva, M. K. de C., Sato, C. M., & Tunçel, L. (2025). A primal-dual extension of the Goemans-Williamson algorithm for the weighted fractional cut-covering problem. Mathematical Programming. doi:10.1007/s10107-025-02209-0
NLM
Proença NB, Silva MK de C, Sato CM, Tunçel L. A primal-dual extension of the Goemans-Williamson algorithm for the weighted fractional cut-covering problem [Internet]. Mathematical Programming. 2025 ;[citado 2025 nov. 19 ] Available from: https://doi.org/10.1007/s10107-025-02209-0
Vancouver
Proença NB, Silva MK de C, Sato CM, Tunçel L. A primal-dual extension of the Goemans-Williamson algorithm for the weighted fractional cut-covering problem [Internet]. Mathematical Programming. 2025 ;[citado 2025 nov. 19 ] Available from: https://doi.org/10.1007/s10107-025-02209-0
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: 19 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. 19 ] 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. 19 ] Available from: https://doi.org/10.1007/s10107-010-0364-8
Artigo de periodico
Global minimization using an Augmented Lagrangian method with variable lower-level constraints (2010)
Birgin, Ernesto Julian Goldberg ; Floudas, Christodoulos A; Martinez, J. M.
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
BIRGIN, Ernesto Julian Goldberg e FLOUDAS, Christodoulos A e MARTINEZ, J. M. Global minimization using an Augmented Lagrangian method with variable lower-level constraints. Mathematical Programming, v. 125, n. 1, p. 139-162, 2010Tradução . . Disponível em: https://doi.org/10.1007/s10107-009-0264-y. Acesso em: 19 nov. 2025.
APA
Birgin, E. J. G., Floudas, C. A., & Martinez, J. M. (2010). Global minimization using an Augmented Lagrangian method with variable lower-level constraints. Mathematical Programming, 125( 1), 139-162. doi:10.1007/s10107-009-0264-y
NLM
Birgin EJG, Floudas CA, Martinez JM. Global minimization using an Augmented Lagrangian method with variable lower-level constraints [Internet]. Mathematical Programming. 2010 ; 125( 1): 139-162.[citado 2025 nov. 19 ] Available from: https://doi.org/10.1007/s10107-009-0264-y
Vancouver
Birgin EJG, Floudas CA, Martinez JM. Global minimization using an Augmented Lagrangian method with variable lower-level constraints [Internet]. Mathematical Programming. 2010 ; 125( 1): 139-162.[citado 2025 nov. 19 ] Available from: https://doi.org/10.1007/s10107-009-0264-y
Artigo de periodico
The node capacitated graph pertitioning problem: a computational study (1998)
Ferreira, Carlos Eduardo ; Martin, A; Souza, C. C; Weismantel, R; Wolsey, Laurence A
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
FERREIRA, Carlos Eduardo et al. The node capacitated graph pertitioning problem: a computational study. Mathematical Programming, v. 81, p. 229-256, 1998Tradução . . Disponível em: https://doi.org/10.1007/bf01581107. Acesso em: 19 nov. 2025.
APA
Ferreira, C. E., Martin, A., Souza, C. C., Weismantel, R., & Wolsey, L. A. (1998). The node capacitated graph pertitioning problem: a computational study. Mathematical Programming, 81, 229-256. doi:10.1007/bf01581107
NLM
Ferreira CE, Martin A, Souza CC, Weismantel R, Wolsey LA. The node capacitated graph pertitioning problem: a computational study [Internet]. Mathematical Programming. 1998 ; 81 229-256.[citado 2025 nov. 19 ] Available from: https://doi.org/10.1007/bf01581107
Vancouver
Ferreira CE, Martin A, Souza CC, Weismantel R, Wolsey LA. The node capacitated graph pertitioning problem: a computational study [Internet]. Mathematical Programming. 1998 ; 81 229-256.[citado 2025 nov. 19 ] Available from: https://doi.org/10.1007/bf01581107

USP Schools

ReP

Filtros

Authors

Funding Agencies

Non normalized affiliation

Countries of institutions of collaboration