ReP USP - Resultado da busca

Artigo de periodico
A minimal face constant rank constraint qualification for reducible conic programming (2025)
Andreani, Roberto ; Haeser, Gabriel ; Mito, Leonardo ; Ramírez, Héctor
Source: Mathematical Programming. Unidade: IME
Subjects: PROGRAMAÇÃO NÃO LINEAR, OTIMIZAÇÃO NÃO LINEAR, PESQUISA OPERACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ANDREANI, Roberto et al. A minimal face constant rank constraint qualification for reducible conic programming. Mathematical Programming, p. 1-27, 2025Tradução . . Disponível em: https://doi.org/10.1007/s10107-025-02237-w. Acesso em: 18 jun. 2025.
APA
Andreani, R., Haeser, G., Mito, L., & Ramírez, H. (2025). A minimal face constant rank constraint qualification for reducible conic programming. Mathematical Programming, 1-27. doi:10.1007/s10107-025-02237-w
NLM
Andreani R, Haeser G, Mito L, Ramírez H. A minimal face constant rank constraint qualification for reducible conic programming [Internet]. Mathematical Programming. 2025 ; 1-27.[citado 2025 jun. 18 ] Available from: https://doi.org/10.1007/s10107-025-02237-w
Vancouver
Andreani R, Haeser G, Mito L, Ramírez H. A minimal face constant rank constraint qualification for reducible conic programming [Internet]. Mathematical Programming. 2025 ; 1-27.[citado 2025 jun. 18 ] Available from: https://doi.org/10.1007/s10107-025-02237-w
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: 18 jun. 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 jun. 18 ] 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 jun. 18 ] Available from: https://doi.org/10.1007/s10107-025-02209-0
Artigo de periodico
Weak notions of nondegeneracy in nonlinear semidefinite programming (2024)
Andreani, Roberto ; Haeser, Gabriel ; Mito, Leonardo Makoto ; Ramírez, Héctor
Source: Mathematical Programming. Unidade: IME
Subjects: PESQUISA OPERACIONAL, PROGRAMAÇÃO NÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ANDREANI, Roberto et al. Weak notions of nondegeneracy in nonlinear semidefinite programming. Mathematical Programming, v. 205, n. 1-2, p. 1-32, 2024Tradução . . Disponível em: https://doi.org/10.1007/s10107-023-01970-4. Acesso em: 18 jun. 2025.
APA
Andreani, R., Haeser, G., Mito, L. M., & Ramírez, H. (2024). Weak notions of nondegeneracy in nonlinear semidefinite programming. Mathematical Programming, 205( 1-2), 1-32. doi:10.1007/s10107-023-01970-4
NLM
Andreani R, Haeser G, Mito LM, Ramírez H. Weak notions of nondegeneracy in nonlinear semidefinite programming [Internet]. Mathematical Programming. 2024 ; 205( 1-2): 1-32.[citado 2025 jun. 18 ] Available from: https://doi.org/10.1007/s10107-023-01970-4
Vancouver
Andreani R, Haeser G, Mito LM, Ramírez H. Weak notions of nondegeneracy in nonlinear semidefinite programming [Internet]. Mathematical Programming. 2024 ; 205( 1-2): 1-32.[citado 2025 jun. 18 ] Available from: https://doi.org/10.1007/s10107-023-01970-4
Artigo de periodico
A primal nonsmooth reformulation for bilevel optimization problems (2023)
Helou, Elias Salomão ; Santos, Sandra Augusta ; Simões, Lucas Eduardo Azevedo
Source: Mathematical Programming. Unidade: ICMC
Subjects: ALGORITMOS, OTIMIZAÇÃO NÃO LINEAR, PROGRAMAÇÃO MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HELOU, Elias Salomão e SANTOS, Sandra Augusta e SIMÕES, Lucas Eduardo Azevedo. A primal nonsmooth reformulation for bilevel optimization problems. Mathematical Programming, v. 198, p. 1381-1409, 2023Tradução . . Disponível em: https://doi.org/10.1007/s10107-021-01764-6. Acesso em: 18 jun. 2025.
APA
Helou, E. S., Santos, S. A., & Simões, L. E. A. (2023). A primal nonsmooth reformulation for bilevel optimization problems. Mathematical Programming, 198, 1381-1409. doi:10.1007/s10107-021-01764-6
NLM
Helou ES, Santos SA, Simões LEA. A primal nonsmooth reformulation for bilevel optimization problems [Internet]. Mathematical Programming. 2023 ; 198 1381-1409.[citado 2025 jun. 18 ] Available from: https://doi.org/10.1007/s10107-021-01764-6
Vancouver
Helou ES, Santos SA, Simões LEA. A primal nonsmooth reformulation for bilevel optimization problems [Internet]. Mathematical Programming. 2023 ; 198 1381-1409.[citado 2025 jun. 18 ] Available from: https://doi.org/10.1007/s10107-021-01764-6
Artigo de periodico
First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition (2023)
Andreani, Roberto ; Haeser, Gabriel ; Mito, Leonardo ; Ramírez, Héctor; Silveira, Thiago Parente da
Source: Mathematical Programming. Unidade: IME
Subjects: PESQUISA OPERACIONAL, PROGRAMAÇÃO NÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ANDREANI, Roberto et al. First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition. Mathematical Programming, v. 202, p. 473-513, 2023Tradução . . Disponível em: https://doi.org/10.1007/s10107-023-01942-8. Acesso em: 18 jun. 2025.
APA
Andreani, R., Haeser, G., Mito, L., Ramírez, H., & Silveira, T. P. da. (2023). First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition. Mathematical Programming, 202, 473-513. doi:10.1007/s10107-023-01942-8
NLM
Andreani R, Haeser G, Mito L, Ramírez H, Silveira TP da. First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition [Internet]. Mathematical Programming. 2023 ; 202 473-513.[citado 2025 jun. 18 ] Available from: https://doi.org/10.1007/s10107-023-01942-8
Vancouver
Andreani R, Haeser G, Mito L, Ramírez H, Silveira TP da. First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition [Internet]. Mathematical Programming. 2023 ; 202 473-513.[citado 2025 jun. 18 ] Available from: https://doi.org/10.1007/s10107-023-01942-8
Artigo de periodico
On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods (2021)
Haeser, Gabriel ; Hinder, Oliver ; Ye, Yinyu
Source: Mathematical Programming. Unidade: IME
Subjects: PROGRAMAÇÃO MATEMÁTICA, PROGRAMAÇÃO CONVEXA, PROGRAMAÇÃO NÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HAESER, Gabriel e HINDER, Oliver e YE, Yinyu. On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods. Mathematical Programming, v. 186, n. 1-2, p. 257-288, 2021Tradução . . Disponível em: https://doi.org/10.1007/s10107-019-01454-4. Acesso em: 18 jun. 2025.
APA
Haeser, G., Hinder, O., & Ye, Y. (2021). On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods. Mathematical Programming, 186( 1-2), 257-288. doi:10.1007/s10107-019-01454-4
NLM
Haeser G, Hinder O, Ye Y. On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods [Internet]. Mathematical Programming. 2021 ; 186( 1-2): 257-288.[citado 2025 jun. 18 ] Available from: https://doi.org/10.1007/s10107-019-01454-4
Vancouver
Haeser G, Hinder O, Ye Y. On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods [Internet]. Mathematical Programming. 2021 ; 186( 1-2): 257-288.[citado 2025 jun. 18 ] Available from: https://doi.org/10.1007/s10107-019-01454-4
Artigo de periodico
Optimality conditions and global convergence for nonlinear semidefinite programming (2020)
Andreani, Roberto ; Haeser, Gabriel ; Viana, Daiana S.
Source: Mathematical Programming. Unidade: IME
Subjects: PROGRAMAÇÃO MATEMÁTICA, PROGRAMAÇÃO NÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ANDREANI, Roberto e HAESER, Gabriel e VIANA, Daiana S. Optimality conditions and global convergence for nonlinear semidefinite programming. Mathematical Programming, v. 180, n. 1-2, p. 203-235, 2020Tradução . . Disponível em: https://doi.org/10.1007/s10107-018-1354-5. Acesso em: 18 jun. 2025.
APA
Andreani, R., Haeser, G., & Viana, D. S. (2020). Optimality conditions and global convergence for nonlinear semidefinite programming. Mathematical Programming, 180( 1-2), 203-235. doi:10.1007/s10107-018-1354-5
NLM
Andreani R, Haeser G, Viana DS. Optimality conditions and global convergence for nonlinear semidefinite programming [Internet]. Mathematical Programming. 2020 ; 180( 1-2): 203-235.[citado 2025 jun. 18 ] Available from: https://doi.org/10.1007/s10107-018-1354-5
Vancouver
Andreani R, Haeser G, Viana DS. Optimality conditions and global convergence for nonlinear semidefinite programming [Internet]. Mathematical Programming. 2020 ; 180( 1-2): 203-235.[citado 2025 jun. 18 ] Available from: https://doi.org/10.1007/s10107-018-1354-5
Artigo de periodico
Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary (2019)
Haeser, Gabriel ; Liu, Hongcheng; Ye, Yinyu
Source: Mathematical Programming. Unidade: IME
Subjects: PROGRAMAÇÃO MATEMÁTICA, PROGRAMAÇÃO NÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HAESER, Gabriel e LIU, Hongcheng e YE, Yinyu. Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary. Mathematical Programming, v. 178, n. 1-2, p. 263-299, 2019Tradução . . Disponível em: https://doi.org/10.1007/s10107-018-1290-4. Acesso em: 18 jun. 2025.
APA
Haeser, G., Liu, H., & Ye, Y. (2019). Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary. Mathematical Programming, 178( 1-2), 263-299. doi:10.1007/s10107-018-1290-4
NLM
Haeser G, Liu H, Ye Y. Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary [Internet]. Mathematical Programming. 2019 ; 178( 1-2): 263-299.[citado 2025 jun. 18 ] Available from: https://doi.org/10.1007/s10107-018-1290-4
Vancouver
Haeser G, Liu H, Ye Y. Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary [Internet]. Mathematical Programming. 2019 ; 178( 1-2): 263-299.[citado 2025 jun. 18 ] Available from: https://doi.org/10.1007/s10107-018-1290-4
Artigo de periodico
An axiomatic duality framework for the theta body and related convex corners (2017)
Silva, Marcel Kenji de Carli ; Tunçel, Levent
Source: Mathematical Programming. Unidade: IME
Subjects: 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
SILVA, Marcel Kenji de Carli e TUNÇEL, Levent. An axiomatic duality framework for the theta body and related convex corners. Mathematical Programming, v. 162, n. 1–2, p. 283-323, 2017Tradução . . Disponível em: https://doi.org/10.1007/s10107-016-1041-3. Acesso em: 18 jun. 2025.
APA
Silva, M. K. de C., & Tunçel, L. (2017). An axiomatic duality framework for the theta body and related convex corners. Mathematical Programming, 162( 1–2), 283-323. doi:10.1007/s10107-016-1041-3
NLM
Silva MK de C, Tunçel L. An axiomatic duality framework for the theta body and related convex corners [Internet]. Mathematical Programming. 2017 ; 162( 1–2): 283-323.[citado 2025 jun. 18 ] Available from: https://doi.org/10.1007/s10107-016-1041-3
Vancouver
Silva MK de C, Tunçel L. An axiomatic duality framework for the theta body and related convex corners [Internet]. Mathematical Programming. 2017 ; 162( 1–2): 283-323.[citado 2025 jun. 18 ] Available from: https://doi.org/10.1007/s10107-016-1041-3
Artigo de periodico
Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models (2017)
Birgin, Ernesto Julian Goldberg ; Gardenghi, J. L.; Martínez, J. M.; Santos, S. A.; Toint, Ph. L.
Source: Mathematical Programming. Unidade: IME
Subjects: OTIMIZAÇÃO NÃO LINEAR, OTIMIZAÇÃO IRRESTRITA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg et al. Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. Mathematical Programming, v. 163, n. 1-2, p. 359-368, 2017Tradução . . Disponível em: https://doi.org/10.1007/s10107-016-1065-8. Acesso em: 18 jun. 2025.
APA
Birgin, E. J. G., Gardenghi, J. L., Martínez, J. M., Santos, S. A., & Toint, P. L. (2017). Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. Mathematical Programming, 163( 1-2), 359-368. doi:10.1007/s10107-016-1065-8
NLM
Birgin EJG, Gardenghi JL, Martínez JM, Santos SA, Toint PL. Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models [Internet]. Mathematical Programming. 2017 ; 163( 1-2): 359-368.[citado 2025 jun. 18 ] Available from: https://doi.org/10.1007/s10107-016-1065-8
Vancouver
Birgin EJG, Gardenghi JL, Martínez JM, Santos SA, Toint PL. Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models [Internet]. Mathematical Programming. 2017 ; 163( 1-2): 359-368.[citado 2025 jun. 18 ] Available from: https://doi.org/10.1007/s10107-016-1065-8
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: 18 jun. 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 jun. 18 ] 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 jun. 18 ] 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: 18 jun. 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 jun. 18 ] 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 jun. 18 ] Available from: https://doi.org/10.1007/s10107-014-0746-4
Artigo de periodico
A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems (2015)
Fernandes, Cristina Gomes ; Meira, Luis A. A; Miyazawa, Flavio Keidi; Pedrosa, Lehilton L. C
Source: Mathematical Programming. Unidade: IME
Subjects: OTIMIZAÇÃO COMBINATÓRIA, PROGRAMAÇÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes et al. A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems. Mathematical Programming, v. No 2015, n. 2, p. 655-685, 2015Tradução . . Disponível em: https://doi.org/10.1007/s10107-014-0821-x. Acesso em: 18 jun. 2025.
APA
Fernandes, C. G., Meira, L. A. A., Miyazawa, F. K., & Pedrosa, L. L. C. (2015). A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems. Mathematical Programming, No 2015( 2), 655-685. doi:10.1007/s10107-014-0821-x
NLM
Fernandes CG, Meira LAA, Miyazawa FK, Pedrosa LLC. A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems [Internet]. Mathematical Programming. 2015 ; No 2015( 2): 655-685.[citado 2025 jun. 18 ] Available from: https://doi.org/10.1007/s10107-014-0821-x
Vancouver
Fernandes CG, Meira LAA, Miyazawa FK, Pedrosa LLC. A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems [Internet]. Mathematical Programming. 2015 ; No 2015( 2): 655-685.[citado 2025 jun. 18 ] Available from: https://doi.org/10.1007/s10107-014-0821-x
Artigo de periodico
The divergence of the BFGS and Gauss Newton methods (2014)
Mascarenhas, Walter Figueiredo
Source: Mathematical Programming. Unidade: IME
Subjects: MÉTODOS NUMÉRICOS DE OTIMIZAÇÃO, PROGRAMAÇÃO NÃO LINEAR, PROGRAMAÇÃO MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MASCARENHAS, Walter Figueiredo. The divergence of the BFGS and Gauss Newton methods. Mathematical Programming, v. 147, n. 1-2, p. 253-276, 2014Tradução . . Disponível em: https://doi.org/10.1007/s10107-013-0720-6. Acesso em: 18 jun. 2025.
APA
Mascarenhas, W. F. (2014). The divergence of the BFGS and Gauss Newton methods. Mathematical Programming, 147( 1-2), 253-276. doi:10.1007/s10107-013-0720-6
NLM
Mascarenhas WF. The divergence of the BFGS and Gauss Newton methods [Internet]. Mathematical Programming. 2014 ; 147( 1-2): 253-276.[citado 2025 jun. 18 ] Available from: https://doi.org/10.1007/s10107-013-0720-6
Vancouver
Mascarenhas WF. The divergence of the BFGS and Gauss Newton methods [Internet]. Mathematical Programming. 2014 ; 147( 1-2): 253-276.[citado 2025 jun. 18 ] Available from: https://doi.org/10.1007/s10107-013-0720-6
Artigo de periodico
A relaxed constant positive linear dependence constraint qualification and applications (2011)
Andreani, Roberto; Haeser, Gabriel ; Schuverdt, María Laura ; Silva, Paulo J. S.
Source: Mathematical Programming. Unidade: IME
Subjects: PROGRAMAÇÃO NÃO LINEAR, CÁLCULO DE VARIAÇÕES, CONTROLE ÓTIMO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ANDREANI, Roberto et al. A relaxed constant positive linear dependence constraint qualification and applications. Mathematical Programming, v. 135, n. 1-2, p. 255-273, 2011Tradução . . Disponível em: https://doi.org/10.1007/s10107-011-0456-0. Acesso em: 18 jun. 2025.
APA
Andreani, R., Haeser, G., Schuverdt, M. L., & Silva, P. J. S. (2011). A relaxed constant positive linear dependence constraint qualification and applications. Mathematical Programming, 135( 1-2), 255-273. doi:10.1007/s10107-011-0456-0
NLM
Andreani R, Haeser G, Schuverdt ML, Silva PJS. A relaxed constant positive linear dependence constraint qualification and applications [Internet]. Mathematical Programming. 2011 ; 135( 1-2): 255-273.[citado 2025 jun. 18 ] Available from: https://doi.org/10.1007/s10107-011-0456-0
Vancouver
Andreani R, Haeser G, Schuverdt ML, Silva PJS. A relaxed constant positive linear dependence constraint qualification and applications [Internet]. Mathematical Programming. 2011 ; 135( 1-2): 255-273.[citado 2025 jun. 18 ] Available from: https://doi.org/10.1007/s10107-011-0456-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: 18 jun. 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 jun. 18 ] 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 jun. 18 ] 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: 18 jun. 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 jun. 18 ] 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 jun. 18 ] Available from: https://doi.org/10.1007/s10107-009-0264-y
Artigo de periodico
Newton's iterates can converge to non-stationary points (2008)
Mascarenhas, Walter Figueiredo
Source: Mathematical Programming. Unidade: IME
Assunto: MÉTODOS NUMÉRICOS DE OTIMIZAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MASCARENHAS, Walter Figueiredo. Newton's iterates can converge to non-stationary points. Mathematical Programming, v. 112, n. 3, p. 327-334, 2008Tradução . . Disponível em: https://doi.org/10.1007/s10107-006-0019-y. Acesso em: 18 jun. 2025.
APA
Mascarenhas, W. F. (2008). Newton's iterates can converge to non-stationary points. Mathematical Programming, 112( 3), 327-334. doi:10.1007/s10107-006-0019-y
NLM
Mascarenhas WF. Newton's iterates can converge to non-stationary points [Internet]. Mathematical Programming. 2008 ; 112( 3): 327-334.[citado 2025 jun. 18 ] Available from: https://doi.org/10.1007/s10107-006-0019-y
Vancouver
Mascarenhas WF. Newton's iterates can converge to non-stationary points [Internet]. Mathematical Programming. 2008 ; 112( 3): 327-334.[citado 2025 jun. 18 ] Available from: https://doi.org/10.1007/s10107-006-0019-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: 18 jun. 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 jun. 18 ] 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 jun. 18 ] Available from: https://doi.org/10.1007/bf01581107
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: 18 jun. 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 jun. 18 ] 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 jun. 18 ] Available from: https://doi.org/10.1007/bf01581107

USP Schools

ReP

Filtros

Authors

USP affiliated authors

Date published

Subjects

Funding Agencies

Indexado em

Non normalized affiliation

Countries of institutions of collaboration