ReP USP - Resultado da busca

Trabalho de evento-resumo
Constant rank constraint qualification for nonlinear second-order cone programming (2023)
Haeser, Gabriel ; Andreani, Roberto ; Mito, Leonardo Makoto ; Ramírez, Héctor ; Silveira, Thiago Parente da
Source: Abstracts. Conference titles: Conference on Optimization - OP23. Unidade: IME
Assunto: PROGRAMAÇÃO NÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HAESER, Gabriel et al. Constant rank constraint qualification for nonlinear second-order cone programming. 2023, Anais.. Philadelphia: SIAM, 2023. Disponível em: https://www.siam.org/Portals/0/Conferences/OP/OP23_ABSTRACTS.pdf. Acesso em: 18 abr. 2024.
APA
Haeser, G., Andreani, R., Mito, L. M., Ramírez, H., & Silveira, T. P. da. (2023). Constant rank constraint qualification for nonlinear second-order cone programming. In Abstracts. Philadelphia: SIAM. Recuperado de https://www.siam.org/Portals/0/Conferences/OP/OP23_ABSTRACTS.pdf
NLM
Haeser G, Andreani R, Mito LM, Ramírez H, Silveira TP da. Constant rank constraint qualification for nonlinear second-order cone programming [Internet]. Abstracts. 2023 ;[citado 2024 abr. 18 ] Available from: https://www.siam.org/Portals/0/Conferences/OP/OP23_ABSTRACTS.pdf
Vancouver
Haeser G, Andreani R, Mito LM, Ramírez H, Silveira TP da. Constant rank constraint qualification for nonlinear second-order cone programming [Internet]. Abstracts. 2023 ;[citado 2024 abr. 18 ] Available from: https://www.siam.org/Portals/0/Conferences/OP/OP23_ABSTRACTS.pdf
Trabalho de evento-resumo
A randomized approximation algorithm for the weighted fractional cut-covering problem (2023)
Proença, Nathan Benedetto ; Silva, Marcel Kenji de Carli ; Sato, Cristiane Maria ; Tunçel, Levent
Source: Abstracts. Conference titles: Conference on Optimization - OP23. Unidade: IME
Subjects: PROGRAMAÇÃO LINEAR, EMPACOTAMENTO E COBERTURA, ALGORITMOS DE APROXIMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
PROENÇA, Nathan Benedetto et al. A randomized approximation algorithm for the weighted fractional cut-covering problem. 2023, Anais.. Philadelphia: SIAM, 2023. Disponível em: https://www.siam.org/Portals/0/Conferences/OP/OP23_ABSTRACTS.pdf. Acesso em: 18 abr. 2024.
APA
Proença, N. B., Silva, M. K. de C., Sato, C. M., & Tunçel, L. (2023). A randomized approximation algorithm for the weighted fractional cut-covering problem. In Abstracts. Philadelphia: SIAM. Recuperado de https://www.siam.org/Portals/0/Conferences/OP/OP23_ABSTRACTS.pdf
NLM
Proença NB, Silva MK de C, Sato CM, Tunçel L. A randomized approximation algorithm for the weighted fractional cut-covering problem [Internet]. Abstracts. 2023 ;[citado 2024 abr. 18 ] Available from: https://www.siam.org/Portals/0/Conferences/OP/OP23_ABSTRACTS.pdf
Vancouver
Proença NB, Silva MK de C, Sato CM, Tunçel L. A randomized approximation algorithm for the weighted fractional cut-covering problem [Internet]. Abstracts. 2023 ;[citado 2024 abr. 18 ] Available from: https://www.siam.org/Portals/0/Conferences/OP/OP23_ABSTRACTS.pdf
Trabalho de evento-resumo
Block coordinate descent for smooth nonconvex constrained minimization (2023)
Birgin, Ernesto Julian Goldberg ; Martínez, José Mário
Source: Abstracts. Conference titles: Conference on Optimization - OP23. Unidade: IME
Subjects: PROGRAMAÇÃO NÃO LINEAR, MÉTODOS NUMÉRICOS, PROGRAMAÇÃO MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e MARTÍNEZ, José Mário. Block coordinate descent for smooth nonconvex constrained minimization. 2023, Anais.. Philadelphia: SIAM, 2023. Disponível em: https://www.siam.org/Portals/0/Conferences/OP/OP23_ABSTRACTS.pdf. Acesso em: 18 abr. 2024.
APA
Birgin, E. J. G., & Martínez, J. M. (2023). Block coordinate descent for smooth nonconvex constrained minimization. In Abstracts. Philadelphia: SIAM. Recuperado de https://www.siam.org/Portals/0/Conferences/OP/OP23_ABSTRACTS.pdf
NLM
Birgin EJG, Martínez JM. Block coordinate descent for smooth nonconvex constrained minimization [Internet]. Abstracts. 2023 ;[citado 2024 abr. 18 ] Available from: https://www.siam.org/Portals/0/Conferences/OP/OP23_ABSTRACTS.pdf
Vancouver
Birgin EJG, Martínez JM. Block coordinate descent for smooth nonconvex constrained minimization [Internet]. Abstracts. 2023 ;[citado 2024 abr. 18 ] Available from: https://www.siam.org/Portals/0/Conferences/OP/OP23_ABSTRACTS.pdf
Trabalho de evento
Extremal and probabilistic results for order types (2019)
Han, Jie; Kohayakawa, Yoshiharu ; Sales, Marcelo T; Stagni, Henrique
Source: Proceedings. Conference titles: ACM-SIAM Symposium on Discrete Algorithms - SODA. Unidade: IME
Assunto: COMBINATÓRIA PROBABILÍSTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HAN, Jie et al. Extremal and probabilistic results for order types. 2019, Anais.. Philadelphia: SIAM, 2019. Disponível em: https://doi.org/10.1137/1.9781611975482.27. Acesso em: 18 abr. 2024.
APA
Han, J., Kohayakawa, Y., Sales, M. T., & Stagni, H. (2019). Extremal and probabilistic results for order types. In Proceedings. Philadelphia: SIAM. doi:10.1137/1.9781611975482.27
NLM
Han J, Kohayakawa Y, Sales MT, Stagni H. Extremal and probabilistic results for order types [Internet]. Proceedings. 2019 ;[citado 2024 abr. 18 ] Available from: https://doi.org/10.1137/1.9781611975482.27
Vancouver
Han J, Kohayakawa Y, Sales MT, Stagni H. Extremal and probabilistic results for order types [Internet]. Proceedings. 2019 ;[citado 2024 abr. 18 ] Available from: https://doi.org/10.1137/1.9781611975482.27
Trabalho de evento-resumo
On a conjecture in second-order optimality conditions (2017)
Vianna, Daianna S; Behling, Roger; Haeser, Gabriel ; Ramos, Alberto
Source: Abstracts. Conference titles: SIAM Conference on Optimization. Unidade: IME
Assunto: OTIMIZAÇÃO MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
VIANNA, Daianna S et al. On a conjecture in second-order optimality conditions. 2017, Anais.. Philadelphia: SIAM, 2017. Disponível em: https://www.siam.org/meetings/op17/op17_abstracts.pdf. Acesso em: 18 abr. 2024.
APA
Vianna, D. S., Behling, R., Haeser, G., & Ramos, A. (2017). On a conjecture in second-order optimality conditions. In Abstracts. Philadelphia: SIAM. Recuperado de https://www.siam.org/meetings/op17/op17_abstracts.pdf
NLM
Vianna DS, Behling R, Haeser G, Ramos A. On a conjecture in second-order optimality conditions [Internet]. Abstracts. 2017 ;[citado 2024 abr. 18 ] Available from: https://www.siam.org/meetings/op17/op17_abstracts.pdf
Vancouver
Vianna DS, Behling R, Haeser G, Ramos A. On a conjecture in second-order optimality conditions [Internet]. Abstracts. 2017 ;[citado 2024 abr. 18 ] Available from: https://www.siam.org/meetings/op17/op17_abstracts.pdf
Trabalho de evento-resumo
Quadratic regularization with cubic descent for unconstrained optimization (2017)
Birgin, Ernesto Julian Goldberg ; Martinez, José Mario
Source: Abstracts. Conference titles: SIAM Conference on Optimization. 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 MARTINEZ, José Mario. Quadratic regularization with cubic descent for unconstrained optimization. 2017, Anais.. Philadelphia: SIAM, 2017. Disponível em: https://www.siam.org/meetings/op17/op17_abstracts.pdf. Acesso em: 18 abr. 2024.
APA
Birgin, E. J. G., & Martinez, J. M. (2017). Quadratic regularization with cubic descent for unconstrained optimization. In Abstracts. Philadelphia: SIAM. Recuperado de https://www.siam.org/meetings/op17/op17_abstracts.pdf
NLM
Birgin EJG, Martinez JM. Quadratic regularization with cubic descent for unconstrained optimization [Internet]. Abstracts. 2017 ;[citado 2024 abr. 18 ] Available from: https://www.siam.org/meetings/op17/op17_abstracts.pdf
Vancouver
Birgin EJG, Martinez JM. Quadratic regularization with cubic descent for unconstrained optimization [Internet]. Abstracts. 2017 ;[citado 2024 abr. 18 ] Available from: https://www.siam.org/meetings/op17/op17_abstracts.pdf
Trabalho de evento-resumo
A second-order optimality condition with first and second-order complementarity associated to global convergence of algorithms (2017)
Haeser, Gabriel
Source: Abstracts. Conference titles: SIAM Conference on Optimization. Unidade: IME
Assunto: OTIMIZAÇÃO MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HAESER, Gabriel. A second-order optimality condition with first and second-order complementarity associated to global convergence of algorithms. 2017, Anais.. Philadelphia: SIAM, 2017. Disponível em: https://www.siam.org/meetings/op17/op17_abstracts.pdf. Acesso em: 18 abr. 2024.
APA
Haeser, G. (2017). A second-order optimality condition with first and second-order complementarity associated to global convergence of algorithms. In Abstracts. Philadelphia: SIAM. Recuperado de https://www.siam.org/meetings/op17/op17_abstracts.pdf
NLM
Haeser G. A second-order optimality condition with first and second-order complementarity associated to global convergence of algorithms [Internet]. Abstracts. 2017 ;[citado 2024 abr. 18 ] Available from: https://www.siam.org/meetings/op17/op17_abstracts.pdf
Vancouver
Haeser G. A second-order optimality condition with first and second-order complementarity associated to global convergence of algorithms [Internet]. Abstracts. 2017 ;[citado 2024 abr. 18 ] Available from: https://www.siam.org/meetings/op17/op17_abstracts.pdf
Monografia/livro
Practical augmented Lagrangian methods for constrained optimization (2014)
Birgin, Ernesto Julian Goldberg ; Martinez, José Mario
Unidade: IME
Subjects: MÉTODOS NUMÉRICOS DE OTIMIZAÇÃO, ALGORITMOS, OTIMIZAÇÃO MATEMÁTICA, COMPUTAÇÃO APLICADA, PROGRAMAÇÃO MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e MARTINEZ, José Mario. Practical augmented Lagrangian methods for constrained optimization. . Philadelphia: SIAM. Disponível em: https://doi.org/10.1137/1.9781611973365. Acesso em: 18 abr. 2024. , 2014
APA
Birgin, E. J. G., & Martinez, J. M. (2014). Practical augmented Lagrangian methods for constrained optimization. Philadelphia: SIAM. doi:10.1137/1.9781611973365
NLM
Birgin EJG, Martinez JM. Practical augmented Lagrangian methods for constrained optimization [Internet]. 2014 ;[citado 2024 abr. 18 ] Available from: https://doi.org/10.1137/1.9781611973365
Vancouver
Birgin EJG, Martinez JM. Practical augmented Lagrangian methods for constrained optimization [Internet]. 2014 ;[citado 2024 abr. 18 ] Available from: https://doi.org/10.1137/1.9781611973365
Trabalho de evento
The maximum size of a Sidon set contained in sparse random set of integers (2011)
Kohayakawa, Yoshiharu ; Lee, Sang June; Rodl, Vojtech
Source: proceedings. Conference titles: ACM-SIAM Symposium on Discrete Algorithms. Unidade: IME
Assunto: ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e LEE, Sang June e RODL, Vojtech. The maximum size of a Sidon set contained in sparse random set of integers. 2011, Anais.. Philadelphia: SIAM, 2011. Disponível em: https://dl.acm.org/citation.cfm?id=2133050. Acesso em: 18 abr. 2024.
APA
Kohayakawa, Y., Lee, S. J., & Rodl, V. (2011). The maximum size of a Sidon set contained in sparse random set of integers. In proceedings. Philadelphia: SIAM. Recuperado de https://dl.acm.org/citation.cfm?id=2133050
NLM
Kohayakawa Y, Lee SJ, Rodl V. The maximum size of a Sidon set contained in sparse random set of integers [Internet]. proceedings. 2011 ;[citado 2024 abr. 18 ] Available from: https://dl.acm.org/citation.cfm?id=2133050
Vancouver
Kohayakawa Y, Lee SJ, Rodl V. The maximum size of a Sidon set contained in sparse random set of integers [Internet]. proceedings. 2011 ;[citado 2024 abr. 18 ] Available from: https://dl.acm.org/citation.cfm?id=2133050
Trabalho de evento
Universality of random graphs (2008)
Dellamonica Junior, Domingos; Kohayakawa, Yoshiharu ; RÖdlt, VojtĚch; Ruciński, Andrzej
Source: Proceedings. Conference titles: ACM-SIAM Symposium on Discrete Algorithms - SODA. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DELLAMONICA JUNIOR, Domingos et al. Universality of random graphs. 2008, Anais.. Philadelphia: SIAM, 2008. Disponível em: https://dl.acm.org/citation.cfm?id=1347168. Acesso em: 18 abr. 2024.
APA
Dellamonica Junior, D., Kohayakawa, Y., RÖdlt, V. Ě., & Ruciński, A. (2008). Universality of random graphs. In Proceedings. Philadelphia: SIAM. Recuperado de https://dl.acm.org/citation.cfm?id=1347168
NLM
Dellamonica Junior D, Kohayakawa Y, RÖdlt VĚ, Ruciński A. Universality of random graphs [Internet]. Proceedings. 2008 ;[citado 2024 abr. 18 ] Available from: https://dl.acm.org/citation.cfm?id=1347168
Vancouver
Dellamonica Junior D, Kohayakawa Y, RÖdlt VĚ, Ruciński A. Universality of random graphs [Internet]. Proceedings. 2008 ;[citado 2024 abr. 18 ] Available from: https://dl.acm.org/citation.cfm?id=1347168
Trabalho de evento
An algorithmic Friedman–Pippenger theorem on tree embeddings and applications to routing (2006)
Dellamonica Junior, Domingos; Kohayakawa, Yoshiharu
Source: Proceedings. Conference titles: ACM-SIAM Symposium on Discrete Algorithms - SODA. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DELLAMONICA JUNIOR, Domingos e KOHAYAKAWA, Yoshiharu. An algorithmic Friedman–Pippenger theorem on tree embeddings and applications to routing. 2006, Anais.. Philadelphia: SIAM, 2006. Disponível em: https://dl-acm-org.ez67.periodicos.capes.gov.br/citation.cfm?doid=1109557.1109672. Acesso em: 18 abr. 2024.
APA
Dellamonica Junior, D., & Kohayakawa, Y. (2006). An algorithmic Friedman–Pippenger theorem on tree embeddings and applications to routing. In Proceedings. Philadelphia: SIAM. Recuperado de https://dl-acm-org.ez67.periodicos.capes.gov.br/citation.cfm?doid=1109557.1109672
NLM
Dellamonica Junior D, Kohayakawa Y. An algorithmic Friedman–Pippenger theorem on tree embeddings and applications to routing [Internet]. Proceedings. 2006 ;[citado 2024 abr. 18 ] Available from: https://dl-acm-org.ez67.periodicos.capes.gov.br/citation.cfm?doid=1109557.1109672
Vancouver
Dellamonica Junior D, Kohayakawa Y. An algorithmic Friedman–Pippenger theorem on tree embeddings and applications to routing [Internet]. Proceedings. 2006 ;[citado 2024 abr. 18 ] Available from: https://dl-acm-org.ez67.periodicos.capes.gov.br/citation.cfm?doid=1109557.1109672
Artigo de periodico
On the motion of solids through an ideal liquid: approximated equations for many body systems (2003)
Ragazzo, Clodoaldo Grotta
Source: Siam Journal on Applied Mathematics. Unidade: IME
Assunto: EQUAÇÕES DIFERENCIAIS PARCIAIS ELÍTICAS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
RAGAZZO, Clodoaldo Grotta. On the motion of solids through an ideal liquid: approximated equations for many body systems. Siam Journal on Applied Mathematics, v. 63, n. 6, p. 1972-1997, 2003Tradução . . Disponível em: https://doi.org/10.1137/S003613990139427X. Acesso em: 18 abr. 2024.
APA
Ragazzo, C. G. (2003). On the motion of solids through an ideal liquid: approximated equations for many body systems. Siam Journal on Applied Mathematics, 63( 6), 1972-1997. doi:10.1137/S003613990139427X
NLM
Ragazzo CG. On the motion of solids through an ideal liquid: approximated equations for many body systems [Internet]. Siam Journal on Applied Mathematics. 2003 ; 63( 6): 1972-1997.[citado 2024 abr. 18 ] Available from: https://doi.org/10.1137/S003613990139427X
Vancouver
Ragazzo CG. On the motion of solids through an ideal liquid: approximated equations for many body systems [Internet]. Siam Journal on Applied Mathematics. 2003 ; 63( 6): 1972-1997.[citado 2024 abr. 18 ] Available from: https://doi.org/10.1137/S003613990139427X
Artigo de periodico
Existence, multiplicity, and regularity for sub-Riemannian geodesics by variational methods (2002)
Giambó, Roberto; Giannoni, Fábio; Piccione, Paolo
Source: Siam Journal on control and Optimization. Unidade: IME
Assunto: GEOMETRIA SUB-RIEMANNIANA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GIAMBÓ, Roberto e GIANNONI, Fábio e PICCIONE, Paolo. Existence, multiplicity, and regularity for sub-Riemannian geodesics by variational methods. Siam Journal on control and Optimization, v. 40, n. 6, p. 1840-1857, 2002Tradução . . Disponível em: https://doi.org/10.1137/S0363012900367242. Acesso em: 18 abr. 2024.
APA
Giambó, R., Giannoni, F., & Piccione, P. (2002). Existence, multiplicity, and regularity for sub-Riemannian geodesics by variational methods. Siam Journal on control and Optimization, 40( 6), 1840-1857. doi:10.1137/S0363012900367242
NLM
Giambó R, Giannoni F, Piccione P. Existence, multiplicity, and regularity for sub-Riemannian geodesics by variational methods [Internet]. Siam Journal on control and Optimization. 2002 ; 40( 6): 1840-1857.[citado 2024 abr. 18 ] Available from: https://doi.org/10.1137/S0363012900367242
Vancouver
Giambó R, Giannoni F, Piccione P. Existence, multiplicity, and regularity for sub-Riemannian geodesics by variational methods [Internet]. Siam Journal on control and Optimization. 2002 ; 40( 6): 1840-1857.[citado 2024 abr. 18 ] Available from: https://doi.org/10.1137/S0363012900367242
Trabalho de evento-resumo
An optimal algorithm for checking regularity: (extended abstract) (2002)
Kohayakawa, Yoshiharu ; Rödl, Vojtěch; Thoma, Luboš
Source: Proceedings. Conference titles: ACM-SIAM Symposium on Discrete Algorithms - SODA. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e RÖDL, Vojtěch e THOMA, Luboš. An optimal algorithm for checking regularity: (extended abstract). 2002, Anais.. Philadelphia: SIAM, 2002. Disponível em: https://dl.acm.org/doi/pdf/10.5555/545381.545418. Acesso em: 18 abr. 2024.
APA
Kohayakawa, Y., Rödl, V., & Thoma, L. (2002). An optimal algorithm for checking regularity: (extended abstract). In Proceedings. Philadelphia: SIAM. Recuperado de https://dl.acm.org/doi/pdf/10.5555/545381.545418
NLM
Kohayakawa Y, Rödl V, Thoma L. An optimal algorithm for checking regularity: (extended abstract) [Internet]. Proceedings. 2002 ;[citado 2024 abr. 18 ] Available from: https://dl.acm.org/doi/pdf/10.5555/545381.545418
Vancouver
Kohayakawa Y, Rödl V, Thoma L. An optimal algorithm for checking regularity: (extended abstract) [Internet]. Proceedings. 2002 ;[citado 2024 abr. 18 ] Available from: https://dl.acm.org/doi/pdf/10.5555/545381.545418
Trabalho de evento-resumo
Heart simulations in the context of the adaptive mesh refinement immersed boundary method (2001)
Roma, Alexandre Megiorin ; Peskin, Charles S.
Conference titles: SIAM Annual Meeting. Unidade: IME
Assunto: ANÁLISE NUMÉRICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ROMA, Alexandre Megiorin e PESKIN, Charles S. Heart simulations in the context of the adaptive mesh refinement immersed boundary method. 2001, Anais.. San Diego: SIAM, 2001. . Acesso em: 18 abr. 2024.
APA
Roma, A. M., & Peskin, C. S. (2001). Heart simulations in the context of the adaptive mesh refinement immersed boundary method. In . San Diego: SIAM.
NLM
Roma AM, Peskin CS. Heart simulations in the context of the adaptive mesh refinement immersed boundary method. 2001 ;[citado 2024 abr. 18 ]
Vancouver
Roma AM, Peskin CS. Heart simulations in the context of the adaptive mesh refinement immersed boundary method. 2001 ;[citado 2024 abr. 18 ]
Artigo de periodico
Rescaling and stepsize selection in proximal methods using separable generalized distances (2001)
Silva, Paulo J. S. ; Eckstein, Jonathan; Humes Júnior, Carlos
Source: Siam Journal on Optimization. Unidade: IME
Assunto: OTIMIZAÇÃO CONVEXA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SILVA, Paulo J. S. e ECKSTEIN, Jonathan e HUMES JÚNIOR, Carlos. Rescaling and stepsize selection in proximal methods using separable generalized distances. Siam Journal on Optimization, v. 12, n. 1, p. 238-261, 2001Tradução . . Disponível em: https://doi.org/10.1137/S1052623499365784. Acesso em: 18 abr. 2024.
APA
Silva, P. J. S., Eckstein, J., & Humes Júnior, C. (2001). Rescaling and stepsize selection in proximal methods using separable generalized distances. Siam Journal on Optimization, 12( 1), 238-261. doi:10.1137/S1052623499365784
NLM
Silva PJS, Eckstein J, Humes Júnior C. Rescaling and stepsize selection in proximal methods using separable generalized distances [Internet]. Siam Journal on Optimization. 2001 ; 12( 1): 238-261.[citado 2024 abr. 18 ] Available from: https://doi.org/10.1137/S1052623499365784
Vancouver
Silva PJS, Eckstein J, Humes Júnior C. Rescaling and stepsize selection in proximal methods using separable generalized distances [Internet]. Siam Journal on Optimization. 2001 ; 12( 1): 238-261.[citado 2024 abr. 18 ] Available from: https://doi.org/10.1137/S1052623499365784
Artigo de periodico
Approximation algorithms for the orthogonal Z-oriented three-dimensional packing problem (2000)
Miyazawa, Flávio Keidi; Wakabayashi, Yoshiko
Source: Siam Journal on Computing. Unidade: IME
Assunto: ALGORITMOS E ESTRUTURAS DE DADOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MIYAZAWA, Flávio Keidi e WAKABAYASHI, Yoshiko. Approximation algorithms for the orthogonal Z-oriented three-dimensional packing problem. Siam Journal on Computing, v. 29, n. 3, p. 1008-1029, 2000Tradução . . Disponível em: https://doi.org/10.1137/S009753979631391X. Acesso em: 18 abr. 2024.
APA
Miyazawa, F. K., & Wakabayashi, Y. (2000). Approximation algorithms for the orthogonal Z-oriented three-dimensional packing problem. Siam Journal on Computing, 29( 3), 1008-1029. doi:10.1137/S009753979631391X
NLM
Miyazawa FK, Wakabayashi Y. Approximation algorithms for the orthogonal Z-oriented three-dimensional packing problem [Internet]. Siam Journal on Computing. 2000 ; 29( 3): 1008-1029.[citado 2024 abr. 18 ] Available from: https://doi.org/10.1137/S009753979631391X
Vancouver
Miyazawa FK, Wakabayashi Y. Approximation algorithms for the orthogonal Z-oriented three-dimensional packing problem [Internet]. Siam Journal on Computing. 2000 ; 29( 3): 1008-1029.[citado 2024 abr. 18 ] Available from: https://doi.org/10.1137/S009753979631391X
Artigo de periodico
Nonmonotone spectral projected gradient methods on convex sets (2000)
Birgin, Ernesto Julian Goldberg ; Martínez, José Mário ; Raydan, M
Source: Siam Journal on Optimization. Unidade: IME
Subjects: ESTRUTURAS, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e MARTÍNEZ, José Mário e RAYDAN, M. Nonmonotone spectral projected gradient methods on convex sets. Siam Journal on Optimization, v. 10, n. 4, p. 1196-1211, 2000Tradução . . Disponível em: https://doi.org/10.1137/S1052623497330963. Acesso em: 18 abr. 2024.
APA
Birgin, E. J. G., Martínez, J. M., & Raydan, M. (2000). Nonmonotone spectral projected gradient methods on convex sets. Siam Journal on Optimization, 10( 4), 1196-1211. doi:10.1137/S1052623497330963
NLM
Birgin EJG, Martínez JM, Raydan M. Nonmonotone spectral projected gradient methods on convex sets [Internet]. Siam Journal on Optimization. 2000 ; 10( 4): 1196-1211.[citado 2024 abr. 18 ] Available from: https://doi.org/10.1137/S1052623497330963
Vancouver
Birgin EJG, Martínez JM, Raydan M. Nonmonotone spectral projected gradient methods on convex sets [Internet]. Siam Journal on Optimization. 2000 ; 10( 4): 1196-1211.[citado 2024 abr. 18 ] Available from: https://doi.org/10.1137/S1052623497330963
Trabalho de evento
Hitting time of hamilton cycles in random bipartite graphs (1991)
Bollobás, Béla ; Kohayakawa, Yoshiharu
Source: Proceedings. Conference titles: International Conference in Graph Theory, Combinatorics, Algorithms and Applications. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOLLOBÁS, Béla e KOHAYAKAWA, Yoshiharu. Hitting time of hamilton cycles in random bipartite graphs. 1991, Anais.. Philadelphia: SIAM, 1991. . Acesso em: 18 abr. 2024.
APA
Bollobás, B., & Kohayakawa, Y. (1991). Hitting time of hamilton cycles in random bipartite graphs. In Proceedings. Philadelphia: SIAM.
NLM
Bollobás B, Kohayakawa Y. Hitting time of hamilton cycles in random bipartite graphs. Proceedings. 1991 ;[citado 2024 abr. 18 ]
Vancouver
Bollobás B, Kohayakawa Y. Hitting time of hamilton cycles in random bipartite graphs. Proceedings. 1991 ;[citado 2024 abr. 18 ]

USP Schools

ReP

Filtros

Authors

USP affiliated authors

Date published

Subjects

Source title

Conference titles

Funding Agencies

Normalized affiliation

Non normalized affiliation

Countries of institutions of collaboration