ReP USP - Resultado da busca

Artigo de periodico
Models for two-dimensional bin packing problems with customer order spread (2024)
Martin, Mateus ; Yanasse, Horacio Hideki ; Santos, Maristela Oliveira dos ; Morabito, Reinaldo
Fonte: Journal of Combinatorial Optimization. Unidade: ICMC
Assuntos: PESQUISA OPERACIONAL, EMPACOTAMENTO E COBERTURA, MANUFATURA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MARTIN, Mateus et al. Models for two-dimensional bin packing problems with customer order spread. Journal of Combinatorial Optimization, v. 48, p. 1-27, 2024Tradução . . Disponível em: https://doi.org/10.1007/s10878-024-01201-2. Acesso em: 30 set. 2024.
APA
Martin, M., Yanasse, H. H., Santos, M. O. dos, & Morabito, R. (2024). Models for two-dimensional bin packing problems with customer order spread. Journal of Combinatorial Optimization, 48, 1-27. doi:10.1007/s10878-024-01201-2
NLM
Martin M, Yanasse HH, Santos MO dos, Morabito R. Models for two-dimensional bin packing problems with customer order spread [Internet]. Journal of Combinatorial Optimization. 2024 ; 48 1-27.[citado 2024 set. 30 ] Available from: https://doi.org/10.1007/s10878-024-01201-2
Vancouver
Martin M, Yanasse HH, Santos MO dos, Morabito R. Models for two-dimensional bin packing problems with customer order spread [Internet]. Journal of Combinatorial Optimization. 2024 ; 48 1-27.[citado 2024 set. 30 ] Available from: https://doi.org/10.1007/s10878-024-01201-2
Artigo de periodico
Weak notions of nondegeneracy in nonlinear semidefinite programming (2024)
Andreani, Roberto ; Haeser, Gabriel ; Mito, Leonardo Makoto ; Ramírez, Héctor
Fonte: Mathematical Programming. Unidade: IME
Assuntos: 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: 30 set. 2024.
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 2024 set. 30 ] 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 2024 set. 30 ] Available from: https://doi.org/10.1007/s10107-023-01970-4
Artigo de periodico
Constraint qualifications and strong global Convergence properties of an augmented lagrangian method on riemannian manifolds (2024)
Andreani, Roberto ; Couto, Kelvin R. ; Ferreira, Orizon Pereira ; Haeser, Gabriel
Fonte: SIAM Journal on Optimization. Unidade: IME
Assuntos: CÁLCULO DE VARIAÇÕES, CONTROLE ÓTIMO, ANÁLISE NUMÉRICA, 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. Constraint qualifications and strong global Convergence properties of an augmented lagrangian method on riemannian manifolds. SIAM Journal on Optimization, v. 34, n. 2, p. 1799-1825, 2024Tradução . . Disponível em: https://doi.org/10.1137/23M1582382. Acesso em: 30 set. 2024.
APA
Andreani, R., Couto, K. R., Ferreira, O. P., & Haeser, G. (2024). Constraint qualifications and strong global Convergence properties of an augmented lagrangian method on riemannian manifolds. SIAM Journal on Optimization, 34( 2), 1799-1825. doi:10.1137/23M1582382
NLM
Andreani R, Couto KR, Ferreira OP, Haeser G. Constraint qualifications and strong global Convergence properties of an augmented lagrangian method on riemannian manifolds [Internet]. SIAM Journal on Optimization. 2024 ; 34( 2): 1799-1825.[citado 2024 set. 30 ] Available from: https://doi.org/10.1137/23M1582382
Vancouver
Andreani R, Couto KR, Ferreira OP, Haeser G. Constraint qualifications and strong global Convergence properties of an augmented lagrangian method on riemannian manifolds [Internet]. SIAM Journal on Optimization. 2024 ; 34( 2): 1799-1825.[citado 2024 set. 30 ] Available from: https://doi.org/10.1137/23M1582382
Artigo de periodico
A forward-looking matheuristic approach for the multi-period two-dimensional non-guillotine cutting stock problem with usable leftovers (2023)
Birgin, Ernesto Julian Goldberg ; Romão, Oberlan Christo ; Ronconi, Débora Pretti
Fonte: Expert Systems with Applications. Unidades: IME, EP
Assuntos: PESQUISA OPERACIONAL, TEORIA DE SISTEMAS E CONTROLE, PROGRAMAÇÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e ROMÃO, Oberlan Christo e RONCONI, Débora Pretti. A forward-looking matheuristic approach for the multi-period two-dimensional non-guillotine cutting stock problem with usable leftovers. Expert Systems with Applications, v. 223, p. 26 on-line, 2023Tradução . . Disponível em: https://doi.org/10.1016/j.eswa.2023.119866. Acesso em: 30 set. 2024.
APA
Birgin, E. J. G., Romão, O. C., & Ronconi, D. P. (2023). A forward-looking matheuristic approach for the multi-period two-dimensional non-guillotine cutting stock problem with usable leftovers. Expert Systems with Applications, 223, 26 on-line. doi:10.1016/j.eswa.2023.119866
NLM
Birgin EJG, Romão OC, Ronconi DP. A forward-looking matheuristic approach for the multi-period two-dimensional non-guillotine cutting stock problem with usable leftovers [Internet]. Expert Systems with Applications. 2023 ; 223 26 on-line.[citado 2024 set. 30 ] Available from: https://doi.org/10.1016/j.eswa.2023.119866
Vancouver
Birgin EJG, Romão OC, Ronconi DP. A forward-looking matheuristic approach for the multi-period two-dimensional non-guillotine cutting stock problem with usable leftovers [Internet]. Expert Systems with Applications. 2023 ; 223 26 on-line.[citado 2024 set. 30 ] Available from: https://doi.org/10.1016/j.eswa.2023.119866
Artigo de periodico
Sequential constant rank constraint qualifications for nonlinear semidefinite programming with algorithmic applications (2023)
Andreani, Roberto ; Haeser, Gabriel ; Mito, Leonardo ; Ramírez, Héctor
Fonte: Set-Valued and Variational Analysis. Unidade: IME
Assuntos: PESQUISA OPERACIONAL, PROGRAMAÇÃO NÃO LINEAR, OTIMIZAÇÃO GLOBAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ANDREANI, Roberto et al. Sequential constant rank constraint qualifications for nonlinear semidefinite programming with algorithmic applications. Set-Valued and Variational Analysis, v. 31, n. artigo 3, p. 1-27, 2023Tradução . . Disponível em: https://doi.org/10.1007/s11228-023-00666-3. Acesso em: 30 set. 2024.
APA
Andreani, R., Haeser, G., Mito, L., & Ramírez, H. (2023). Sequential constant rank constraint qualifications for nonlinear semidefinite programming with algorithmic applications. Set-Valued and Variational Analysis, 31( artigo 3), 1-27. doi:10.1007/s11228-023-00666-3
NLM
Andreani R, Haeser G, Mito L, Ramírez H. Sequential constant rank constraint qualifications for nonlinear semidefinite programming with algorithmic applications [Internet]. Set-Valued and Variational Analysis. 2023 ; 31( artigo 3): 1-27.[citado 2024 set. 30 ] Available from: https://doi.org/10.1007/s11228-023-00666-3
Vancouver
Andreani R, Haeser G, Mito L, Ramírez H. Sequential constant rank constraint qualifications for nonlinear semidefinite programming with algorithmic applications [Internet]. Set-Valued and Variational Analysis. 2023 ; 31( artigo 3): 1-27.[citado 2024 set. 30 ] Available from: https://doi.org/10.1007/s11228-023-00666-3
Artigo de periodico
A one-dimensional puzzle to teach integer programming (2023)
Leão, Aline Aparecida Souza ; Oliveira Filho, Adaiton Moreira; Toledo, Franklina Maria Bragion de
Fonte: International Journal of Mathematical Education in Science and Technology. Unidades: ICMC, EESC
Assuntos: PESQUISA OPERACIONAL, PROGRAMAÇÃO MATEMÁTICA, MOTIVAÇÃO DO ALUNO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
LEÃO, Aline Aparecida Souza e OLIVEIRA FILHO, Adaiton Moreira e TOLEDO, Franklina Maria Bragion de. A one-dimensional puzzle to teach integer programming. International Journal of Mathematical Education in Science and Technology, v. 54, n. 7, p. 1339-1348, 2023Tradução . . Disponível em: https://doi.org/10.1080/0020739X.2022.2141149. Acesso em: 30 set. 2024.
APA
Leão, A. A. S., Oliveira Filho, A. M., & Toledo, F. M. B. de. (2023). A one-dimensional puzzle to teach integer programming. International Journal of Mathematical Education in Science and Technology, 54( 7), 1339-1348. doi:10.1080/0020739X.2022.2141149
NLM
Leão AAS, Oliveira Filho AM, Toledo FMB de. A one-dimensional puzzle to teach integer programming [Internet]. International Journal of Mathematical Education in Science and Technology. 2023 ; 54( 7): 1339-1348.[citado 2024 set. 30 ] Available from: https://doi.org/10.1080/0020739X.2022.2141149
Vancouver
Leão AAS, Oliveira Filho AM, Toledo FMB de. A one-dimensional puzzle to teach integer programming [Internet]. International Journal of Mathematical Education in Science and Technology. 2023 ; 54( 7): 1339-1348.[citado 2024 set. 30 ] Available from: https://doi.org/10.1080/0020739X.2022.2141149
Artigo de periodico
Visualizing high-dimensional functions with dense maps (2023)
Espadoto, Mateus ; Rodrigues, Francisco Caio Maia ; Hirata, Nina Sumiko Tomita ; Telea, Alexandru Cristian
Fonte: SN Computer Science. Unidades: IME, ICMC
Assuntos: APRENDIZADO COMPUTACIONAL, PESQUISA OPERACIONAL, REGRESSÃO, OTIMIZAÇÃO MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ESPADOTO, Mateus et al. Visualizing high-dimensional functions with dense maps. SN Computer Science, v. 4, n. artigo 230, p. 1, 2023Tradução . . Disponível em: https://doi.org/10.1007/s42979-022-01664-2. Acesso em: 30 set. 2024.
APA
Espadoto, M., Rodrigues, F. C. M., Hirata, N. S. T., & Telea, A. C. (2023). Visualizing high-dimensional functions with dense maps. SN Computer Science, 4( artigo 230), 1. doi:10.1007/s42979-022-01664-2
NLM
Espadoto M, Rodrigues FCM, Hirata NST, Telea AC. Visualizing high-dimensional functions with dense maps [Internet]. SN Computer Science. 2023 ; 4( artigo 230): 1.[citado 2024 set. 30 ] Available from: https://doi.org/10.1007/s42979-022-01664-2
Vancouver
Espadoto M, Rodrigues FCM, Hirata NST, Telea AC. Visualizing high-dimensional functions with dense maps [Internet]. SN Computer Science. 2023 ; 4( artigo 230): 1.[citado 2024 set. 30 ] Available from: https://doi.org/10.1007/s42979-022-01664-2
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
Fonte: Mathematical Programming. Unidade: IME
Assuntos: 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: 30 set. 2024.
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 2024 set. 30 ] 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 2024 set. 30 ] Available from: https://doi.org/10.1007/s10107-023-01942-8
Trabalho de evento-anais periodico
Interactive internet-based tool proposal for the WASPAS method: a contribution for decesion-making process (2023)
Barbara, Flavio; Moreira, Miguel Ângelo Lellis ; Fávero, Luiz Paulo Lopes ; Santos, Marcos dos
Fonte: Procedia Computer Science. Nome do evento: International Conference on Information Technology and Quantitative Management (ITQM 2023). Unidades: FEA, ESALQ
Assuntos: TEORIA DA DECISÃO, PESQUISA OPERACIONAL, R (SOFTWARE ESTATÍSTICO)
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BARBARA, Flavio et al. Interactive internet-based tool proposal for the WASPAS method: a contribution for decesion-making process. Procedia Computer Science. Amsterdam: Faculdade de Economia, Administração, Contabilidade e Atuária, Universidade de São Paulo. Disponível em: https://www.sciencedirect.com/science/article/pii/S187705092300724X/pdf?md5=a1c04b652bed8f902818df3df7b5fc8b&pid=1-s2.0-S187705092300724X-main.pdf. Acesso em: 30 set. 2024. , 2023
APA
Barbara, F., Moreira, M. Â. L., Fávero, L. P. L., & Santos, M. dos. (2023). Interactive internet-based tool proposal for the WASPAS method: a contribution for decesion-making process. Procedia Computer Science. Amsterdam: Faculdade de Economia, Administração, Contabilidade e Atuária, Universidade de São Paulo. doi:10.1016/j.procs.2023.07.028
NLM
Barbara F, Moreira MÂL, Fávero LPL, Santos M dos. Interactive internet-based tool proposal for the WASPAS method: a contribution for decesion-making process [Internet]. Procedia Computer Science. 2023 ; 221 200-207.[citado 2024 set. 30 ] Available from: https://www.sciencedirect.com/science/article/pii/S187705092300724X/pdf?md5=a1c04b652bed8f902818df3df7b5fc8b&pid=1-s2.0-S187705092300724X-main.pdf
Vancouver
Barbara F, Moreira MÂL, Fávero LPL, Santos M dos. Interactive internet-based tool proposal for the WASPAS method: a contribution for decesion-making process [Internet]. Procedia Computer Science. 2023 ; 221 200-207.[citado 2024 set. 30 ] Available from: https://www.sciencedirect.com/science/article/pii/S187705092300724X/pdf?md5=a1c04b652bed8f902818df3df7b5fc8b&pid=1-s2.0-S187705092300724X-main.pdf
Artigo de periodico
Simulation-optimization of inventory control of multiple products on a single machine with sequence-dependent setup times (2022)
Mesquita, Marco Aurélio de ; Tomotani, João Vitor
Fonte: Computers & Industrial Engineering. Unidade: EP
Assuntos: CONTROLE DE ESTOQUES, PROGRAMAÇÃO DA PRODUÇÃO, PESQUISA OPERACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MESQUITA, Marco Aurélio de e TOMOTANI, João Vitor. Simulation-optimization of inventory control of multiple products on a single machine with sequence-dependent setup times. Computers & Industrial Engineering, v. 174, p. 10 on-line, 2022Tradução . . Disponível em: https://doi.org/10.1016/j.cie.2022.108793. Acesso em: 30 set. 2024.
APA
Mesquita, M. A. de, & Tomotani, J. V. (2022). Simulation-optimization of inventory control of multiple products on a single machine with sequence-dependent setup times. Computers & Industrial Engineering, 174, 10 on-line. doi:10.1016/j.cie.2022.108793
NLM
Mesquita MA de, Tomotani JV. Simulation-optimization of inventory control of multiple products on a single machine with sequence-dependent setup times [Internet]. Computers & Industrial Engineering. 2022 ; 174 10 on-line.[citado 2024 set. 30 ] Available from: https://doi.org/10.1016/j.cie.2022.108793
Vancouver
Mesquita MA de, Tomotani JV. Simulation-optimization of inventory control of multiple products on a single machine with sequence-dependent setup times [Internet]. Computers & Industrial Engineering. 2022 ; 174 10 on-line.[citado 2024 set. 30 ] Available from: https://doi.org/10.1016/j.cie.2022.108793
Artigo de periodico
On optimality conditions for nonlinear conic programming (2022)
Andreani, Roberto ; Gómez, Walter ; Haeser, Gabriel ; Mito, Leonardo ; Ramos, Alberto
Fonte: Mathematics of Operations Research. Unidade: IME
Assuntos: PESQUISA OPERACIONAL, 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 et al. On optimality conditions for nonlinear conic programming. Mathematics of Operations Research, v. 47, n. 3, p. 2160-2185, 2022Tradução . . Disponível em: https://doi.org/10.1287/moor.2021.1203. Acesso em: 30 set. 2024.
APA
Andreani, R., Gómez, W., Haeser, G., Mito, L., & Ramos, A. (2022). On optimality conditions for nonlinear conic programming. Mathematics of Operations Research, 47( 3), 2160-2185. doi:10.1287/moor.2021.1203
NLM
Andreani R, Gómez W, Haeser G, Mito L, Ramos A. On optimality conditions for nonlinear conic programming [Internet]. Mathematics of Operations Research. 2022 ; 47( 3): 2160-2185.[citado 2024 set. 30 ] Available from: https://doi.org/10.1287/moor.2021.1203
Vancouver
Andreani R, Gómez W, Haeser G, Mito L, Ramos A. On optimality conditions for nonlinear conic programming [Internet]. Mathematics of Operations Research. 2022 ; 47( 3): 2160-2185.[citado 2024 set. 30 ] Available from: https://doi.org/10.1287/moor.2021.1203
Trabalho de evento-resumo
MIP-Heuristics for the multi-level capacitated lot sizing problem (2022)
Ueno, Fernanda Yuka ; Furlan, Marcos ; Santos, Maristela Oliveira dos
Fonte: Abstract Book. Nome do evento: Latin Ibero-American Conference on Operations Research - CLAIO. Unidade: ICMC
Assuntos: PESQUISA OPERACIONAL, HEURÍSTICA, CUSTO INDUSTRIAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
UENO, Fernanda Yuka e FURLAN, Marcos e SANTOS, Maristela Oliveira dos. MIP-Heuristics for the multi-level capacitated lot sizing problem. 2022, Anais.. Buenos Aires: Association of Latin-Iberoamerican Operational Research Societies, 2022. Disponível em: https://claio2022.dc.uba.ar. Acesso em: 30 set. 2024.
APA
Ueno, F. Y., Furlan, M., & Santos, M. O. dos. (2022). MIP-Heuristics for the multi-level capacitated lot sizing problem. In Abstract Book. Buenos Aires: Association of Latin-Iberoamerican Operational Research Societies. Recuperado de https://claio2022.dc.uba.ar
NLM
Ueno FY, Furlan M, Santos MO dos. MIP-Heuristics for the multi-level capacitated lot sizing problem [Internet]. Abstract Book. 2022 ;[citado 2024 set. 30 ] Available from: https://claio2022.dc.uba.ar
Vancouver
Ueno FY, Furlan M, Santos MO dos. MIP-Heuristics for the multi-level capacitated lot sizing problem [Internet]. Abstract Book. 2022 ;[citado 2024 set. 30 ] Available from: https://claio2022.dc.uba.ar
Artigo de periodico
Global convergence of algorithms under constant rank conditions for nonlinear second-order cone programming (2022)
Andreani, Roberto ; Haeser, Gabriel ; Mito, Leonardo ; Ramírez, C. Héctor ; Silveira, Thiago Parente da
Fonte: Journal of Optimization Theory and Applications. Unidade: IME
Assuntos: PESQUISA OPERACIONAL, 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 et al. Global convergence of algorithms under constant rank conditions for nonlinear second-order cone programming. Journal of Optimization Theory and Applications, v. 195, p. 42-78, 2022Tradução . . Disponível em: https://doi.org/10.1007/s10957-022-02056-5. Acesso em: 30 set. 2024.
APA
Andreani, R., Haeser, G., Mito, L., Ramírez, C. H., & Silveira, T. P. da. (2022). Global convergence of algorithms under constant rank conditions for nonlinear second-order cone programming. Journal of Optimization Theory and Applications, 195, 42-78. doi:10.1007/s10957-022-02056-5
NLM
Andreani R, Haeser G, Mito L, Ramírez CH, Silveira TP da. Global convergence of algorithms under constant rank conditions for nonlinear second-order cone programming [Internet]. Journal of Optimization Theory and Applications. 2022 ; 195 42-78.[citado 2024 set. 30 ] Available from: https://doi.org/10.1007/s10957-022-02056-5
Vancouver
Andreani R, Haeser G, Mito L, Ramírez CH, Silveira TP da. Global convergence of algorithms under constant rank conditions for nonlinear second-order cone programming [Internet]. Journal of Optimization Theory and Applications. 2022 ; 195 42-78.[citado 2024 set. 30 ] Available from: https://doi.org/10.1007/s10957-022-02056-5
Artigo de periodico
Secant acceleration of sequential residual methods for solving large-scale nonlinear systems of equations (2022)
Birgin, Ernesto Julian Goldberg ; Martínez, José Mário
Fonte: SIAM Journal on Numerical Analysis. Unidade: IME
Assuntos: ANÁLISE NUMÉRICA, PESQUISA OPERACIONAL
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. Secant acceleration of sequential residual methods for solving large-scale nonlinear systems of equations. SIAM Journal on Numerical Analysis, v. 60, n. 6, p. 3145-3180, 2022Tradução . . Disponível em: https://doi.org/10.1137/20M1388024. Acesso em: 30 set. 2024.
APA
Birgin, E. J. G., & Martínez, J. M. (2022). Secant acceleration of sequential residual methods for solving large-scale nonlinear systems of equations. SIAM Journal on Numerical Analysis, 60( 6), 3145-3180. doi:10.1137/20M1388024
NLM
Birgin EJG, Martínez JM. Secant acceleration of sequential residual methods for solving large-scale nonlinear systems of equations [Internet]. SIAM Journal on Numerical Analysis. 2022 ; 60( 6): 3145-3180.[citado 2024 set. 30 ] Available from: https://doi.org/10.1137/20M1388024
Vancouver
Birgin EJG, Martínez JM. Secant acceleration of sequential residual methods for solving large-scale nonlinear systems of equations [Internet]. SIAM Journal on Numerical Analysis. 2022 ; 60( 6): 3145-3180.[citado 2024 set. 30 ] Available from: https://doi.org/10.1137/20M1388024
Artigo de periodico
On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization (2022)
Amaral, V. S.; Andreani, Roberto ; Birgin, Ernesto Julian Goldberg ; Marcondes, Diaulas Murize Santana Vieira ; Martínez, José Mário
Fonte: Journal of Global Optimization. Unidade: IME
Assuntos: PROGRAMAÇÃO NÃO LINEAR, CÁLCULO DE VARIAÇÕES, CONTROLE ÓTIMO, MÉTODOS NUMÉRICOS, ANÁLISE NUMÉRICA, PESQUISA OPERACIONAL, CIÊNCIA DA COMPUTAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
AMARAL, V. S. et al. On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization. Journal of Global Optimization, v. 84, p. 527-561, 2022Tradução . . Disponível em: https://doi.org/10.1007/s10898-022-01168-6. Acesso em: 30 set. 2024.
APA
Amaral, V. S., Andreani, R., Birgin, E. J. G., Marcondes, D. M. S. V., & Martínez, J. M. (2022). On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization. Journal of Global Optimization, 84, 527-561. doi:10.1007/s10898-022-01168-6
NLM
Amaral VS, Andreani R, Birgin EJG, Marcondes DMSV, Martínez JM. On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization [Internet]. Journal of Global Optimization. 2022 ; 84 527-561.[citado 2024 set. 30 ] Available from: https://doi.org/10.1007/s10898-022-01168-6
Vancouver
Amaral VS, Andreani R, Birgin EJG, Marcondes DMSV, Martínez JM. On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization [Internet]. Journal of Global Optimization. 2022 ; 84 527-561.[citado 2024 set. 30 ] Available from: https://doi.org/10.1007/s10898-022-01168-6
Artigo de periodico
Inexact restoration for derivative-free expensive function minimization and applications (2022)
Birgin, Ernesto Julian Goldberg ; Krejić, Nataša ; Martínez, José Mário
Fonte: Journal of Computational and Applied Mathematics. Unidade: IME
Assuntos: ANÁLISE NUMÉRICA, PROGRAMAÇÃO NÃO LINEAR, PESQUISA OPERACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e KREJIĆ, Nataša e MARTÍNEZ, José Mário. Inexact restoration for derivative-free expensive function minimization and applications. Journal of Computational and Applied Mathematics, v. 410, n. artigo 114193, p. 1-15, 2022Tradução . . Disponível em: https://doi.org/10.1016/j.cam.2022.114193. Acesso em: 30 set. 2024.
APA
Birgin, E. J. G., Krejić, N., & Martínez, J. M. (2022). Inexact restoration for derivative-free expensive function minimization and applications. Journal of Computational and Applied Mathematics, 410( artigo 114193), 1-15. doi:10.1016/j.cam.2022.114193
NLM
Birgin EJG, Krejić N, Martínez JM. Inexact restoration for derivative-free expensive function minimization and applications [Internet]. Journal of Computational and Applied Mathematics. 2022 ; 410( artigo 114193): 1-15.[citado 2024 set. 30 ] Available from: https://doi.org/10.1016/j.cam.2022.114193
Vancouver
Birgin EJG, Krejić N, Martínez JM. Inexact restoration for derivative-free expensive function minimization and applications [Internet]. Journal of Computational and Applied Mathematics. 2022 ; 410( artigo 114193): 1-15.[citado 2024 set. 30 ] Available from: https://doi.org/10.1016/j.cam.2022.114193
Artigo de periodico
MILP formulation and hybrid evolutionary algorithms for the glass container industry problem with multiple furnaces (2021)
Amorim, Flaviana Moreira de Souza ; Arantes, Márcio da Silva ; Ferreira, Magna Paulina de Souza; Toledo, Claudio Fabiano Motta
Fonte: Computers and Industrial Engineering. Unidade: ICMC
Assuntos: ALGORITMOS GENÉTICOS, PESQUISA OPERACIONAL, INDÚSTRIA DO VIDRO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
AMORIM, Flaviana Moreira de Souza et al. MILP formulation and hybrid evolutionary algorithms for the glass container industry problem with multiple furnaces. Computers and Industrial Engineering, v. 158, p. 1-14, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.cie.2021.107398. Acesso em: 30 set. 2024.
APA
Amorim, F. M. de S., Arantes, M. da S., Ferreira, M. P. de S., & Toledo, C. F. M. (2021). MILP formulation and hybrid evolutionary algorithms for the glass container industry problem with multiple furnaces. Computers and Industrial Engineering, 158, 1-14. doi:10.1016/j.cie.2021.107398
NLM
Amorim FM de S, Arantes M da S, Ferreira MP de S, Toledo CFM. MILP formulation and hybrid evolutionary algorithms for the glass container industry problem with multiple furnaces [Internet]. Computers and Industrial Engineering. 2021 ; 158 1-14.[citado 2024 set. 30 ] Available from: https://doi.org/10.1016/j.cie.2021.107398
Vancouver
Amorim FM de S, Arantes M da S, Ferreira MP de S, Toledo CFM. MILP formulation and hybrid evolutionary algorithms for the glass container industry problem with multiple furnaces [Internet]. Computers and Industrial Engineering. 2021 ; 158 1-14.[citado 2024 set. 30 ] Available from: https://doi.org/10.1016/j.cie.2021.107398
Artigo de periodico
Efficient algorithms for Risk-Sensitive Markov Decision Processes with limited budget (2021)
Moreira, Daniel Augusto de Melo; Delgado, Karina Valdivia ; Barros, Leliane Nunes de ; Mauá, Denis Deratani
Fonte: International Journal of Approximate Reasoning. Unidades: EACH, IME
Assuntos: PESQUISA OPERACIONAL, PROGRAMAÇÃO MATEMÁTICA, PROCESSOS DE MARKOV, TEORIA DOS JOGOS, TEORIA DA DECISÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MOREIRA, Daniel Augusto de Melo et al. Efficient algorithms for Risk-Sensitive Markov Decision Processes with limited budget. International Journal of Approximate Reasoning, v. 139, p. 143-165, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2021.09.003. Acesso em: 30 set. 2024.
APA
Moreira, D. A. de M., Delgado, K. V., Barros, L. N. de, & Mauá, D. D. (2021). Efficient algorithms for Risk-Sensitive Markov Decision Processes with limited budget. International Journal of Approximate Reasoning, 139, 143-165. doi:10.1016/j.ijar.2021.09.003
NLM
Moreira DA de M, Delgado KV, Barros LN de, Mauá DD. Efficient algorithms for Risk-Sensitive Markov Decision Processes with limited budget [Internet]. International Journal of Approximate Reasoning. 2021 ; 139 143-165.[citado 2024 set. 30 ] Available from: https://doi.org/10.1016/j.ijar.2021.09.003
Vancouver
Moreira DA de M, Delgado KV, Barros LN de, Mauá DD. Efficient algorithms for Risk-Sensitive Markov Decision Processes with limited budget [Internet]. International Journal of Approximate Reasoning. 2021 ; 139 143-165.[citado 2024 set. 30 ] Available from: https://doi.org/10.1016/j.ijar.2021.09.003
Trabalho de evento-resumo
Addressing the multistage integrated procurement and lot-sizing problem with demand fulfillment, backlogging and service levels (2021)
Tomazella, Caio Paziani ; Santos, Maristela Oliveira dos ; Alem Junior, Douglas José ; Jans, Raf
Fonte: Abstract Book. Nome do evento: European Conference on Operational Research. Unidade: ICMC
Assunto: PESQUISA OPERACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
TOMAZELLA, Caio Paziani et al. Addressing the multistage integrated procurement and lot-sizing problem with demand fulfillment, backlogging and service levels. 2021, Anais.. Fribourg: Association of European Operational Research Societies, 2021. Disponível em: https://www.euro-online.org/media_site/reports/EURO31_AB.pdf. Acesso em: 30 set. 2024.
APA
Tomazella, C. P., Santos, M. O. dos, Alem Junior, D. J., & Jans, R. (2021). Addressing the multistage integrated procurement and lot-sizing problem with demand fulfillment, backlogging and service levels. In Abstract Book. Fribourg: Association of European Operational Research Societies. Recuperado de https://www.euro-online.org/media_site/reports/EURO31_AB.pdf
NLM
Tomazella CP, Santos MO dos, Alem Junior DJ, Jans R. Addressing the multistage integrated procurement and lot-sizing problem with demand fulfillment, backlogging and service levels [Internet]. Abstract Book. 2021 ;[citado 2024 set. 30 ] Available from: https://www.euro-online.org/media_site/reports/EURO31_AB.pdf
Vancouver
Tomazella CP, Santos MO dos, Alem Junior DJ, Jans R. Addressing the multistage integrated procurement and lot-sizing problem with demand fulfillment, backlogging and service levels [Internet]. Abstract Book. 2021 ;[citado 2024 set. 30 ] Available from: https://www.euro-online.org/media_site/reports/EURO31_AB.pdf
Artigo de periodico
Dual Hoffman bounds for the stability and chromatic numbers based on semidefinite programming (2021)
Proença, Nathan Benedetto; Silva, Marcel Kenji de Carli ; Coutinho, Gabriel
Fonte: SIAM Journal on Discrete Mathematics. Unidade: IME
Assuntos: PESQUISA OPERACIONAL, COMBINATÓRIA, TEORIA DOS GRAFOS, PROGRAMAÇÃO MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
PROENÇA, Nathan Benedetto e SILVA, Marcel Kenji de Carli e COUTINHO, Gabriel. Dual Hoffman bounds for the stability and chromatic numbers based on semidefinite programming. SIAM Journal on Discrete Mathematics, v. 35, n. 4, p. 2880–2907, 2021Tradução . . Disponível em: https://doi.org/10.1137/19M1306427. Acesso em: 30 set. 2024.
APA
Proença, N. B., Silva, M. K. de C., & Coutinho, G. (2021). Dual Hoffman bounds for the stability and chromatic numbers based on semidefinite programming. SIAM Journal on Discrete Mathematics, 35( 4), 2880–2907. doi:10.1137/19M1306427
NLM
Proença NB, Silva MK de C, Coutinho G. Dual Hoffman bounds for the stability and chromatic numbers based on semidefinite programming [Internet]. SIAM Journal on Discrete Mathematics. 2021 ; 35( 4): 2880–2907.[citado 2024 set. 30 ] Available from: https://doi.org/10.1137/19M1306427
Vancouver
Proença NB, Silva MK de C, Coutinho G. Dual Hoffman bounds for the stability and chromatic numbers based on semidefinite programming [Internet]. SIAM Journal on Discrete Mathematics. 2021 ; 35( 4): 2880–2907.[citado 2024 set. 30 ] Available from: https://doi.org/10.1137/19M1306427

Unidades USP

ReP

Filtros

Tipo de material

Unidades USP

Departamento

Autores

Autores USP

Ano de publicação

Assuntos

Título da fonte

Editora

Nome do evento

País de publicação

Agência de fomento

Indexado em

Afiliação dos autores externos normalizada

Afiliação dos autores externos não normalizada

País das instituições de afiliação dos autores externos