ReP USP - Resultado da busca

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: 21 jul. 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 jul. 21 ] 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 jul. 21 ] 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
Source: SIAM Journal on Optimization. Unidade: IME
Subjects: 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: 21 jul. 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 jul. 21 ] 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 jul. 21 ] 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
Source: Expert Systems with Applications. Unidades: IME, EP
Subjects: 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: 21 jul. 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 jul. 21 ] 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 jul. 21 ] 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
Source: Set-Valued and Variational Analysis. Unidade: IME
Subjects: 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: 21 jul. 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 jul. 21 ] 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 jul. 21 ] 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
Source: International Journal of Mathematical Education in Science and Technology. Unidades: ICMC, EESC
Subjects: 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: 21 jul. 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 jul. 21 ] 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 jul. 21 ] 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
Source: SN Computer Science. Unidades: IME, ICMC
Subjects: 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: 21 jul. 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 jul. 21 ] 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 jul. 21 ] Available from: https://doi.org/10.1007/s42979-022-01664-2
Artigo de periodico
A biobjective matheuristic for the integrated solution of the irregular strip packing and the cutting path determination problems (2023)
Oliveira, Larissa Tebaldi de ; Carravilla, Maria Antónia ; Oliveira, José Fernando ; Toledo, Franklina Maria Bragion de
Source: Pesquisa Operacional. Unidade: ICMC
Subjects: PESQUISA OPERACIONAL, PRODUTIVIDADE, CORTE, ALGORITMOS GENÉTICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
OLIVEIRA, Larissa Tebaldi de et al. A biobjective matheuristic for the integrated solution of the irregular strip packing and the cutting path determination problems. Pesquisa Operacional, v. 43, p. 1-26, 2023Tradução . . Disponível em: https://doi.org/10.1590/0101-7438.2023.043.00275212. Acesso em: 21 jul. 2024.
APA
Oliveira, L. T. de, Carravilla, M. A., Oliveira, J. F., & Toledo, F. M. B. de. (2023). A biobjective matheuristic for the integrated solution of the irregular strip packing and the cutting path determination problems. Pesquisa Operacional, 43, 1-26. doi:10.1590/0101-7438.2023.043.00275212
NLM
Oliveira LT de, Carravilla MA, Oliveira JF, Toledo FMB de. A biobjective matheuristic for the integrated solution of the irregular strip packing and the cutting path determination problems [Internet]. Pesquisa Operacional. 2023 ; 43 1-26.[citado 2024 jul. 21 ] Available from: https://doi.org/10.1590/0101-7438.2023.043.00275212
Vancouver
Oliveira LT de, Carravilla MA, Oliveira JF, Toledo FMB de. A biobjective matheuristic for the integrated solution of the irregular strip packing and the cutting path determination problems [Internet]. Pesquisa Operacional. 2023 ; 43 1-26.[citado 2024 jul. 21 ] Available from: https://doi.org/10.1590/0101-7438.2023.043.00275212
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: 21 jul. 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 jul. 21 ] 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 jul. 21 ] Available from: https://doi.org/10.1007/s10107-023-01942-8
Artigo de periodico
On optimality conditions for nonlinear conic programming (2022)
Andreani, Roberto ; Gómez, Walter ; Haeser, Gabriel ; Mito, Leonardo ; Ramos, Alberto
Source: Mathematics of Operations Research. Unidade: IME
Subjects: 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: 21 jul. 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 jul. 21 ] 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 jul. 21 ] Available from: https://doi.org/10.1287/moor.2021.1203
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
Source: Computers & Industrial Engineering. Unidade: EP
Subjects: 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: 21 jul. 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 jul. 21 ] 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 jul. 21 ] Available from: https://doi.org/10.1016/j.cie.2022.108793
Trabalho de evento-resumo
MIP-Heuristics for the multi-level capacitated lot sizing problem (2022)
Ueno, Fernanda Yuka ; Furlan, Marcos ; Santos, Maristela Oliveira dos
Source: Abstract Book. Conference titles: Latin Ibero-American Conference on Operations Research - CLAIO. Unidade: ICMC
Subjects: 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: 21 jul. 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 jul. 21 ] 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 jul. 21 ] 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
Source: Journal of Optimization Theory and Applications. Unidade: IME
Subjects: 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: 21 jul. 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 jul. 21 ] 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 jul. 21 ] 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
Source: SIAM Journal on Numerical Analysis. Unidade: IME
Subjects: 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: 21 jul. 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 jul. 21 ] 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 jul. 21 ] 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
Source: Journal of Global Optimization. Unidade: IME
Subjects: 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: 21 jul. 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 jul. 21 ] 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 jul. 21 ] 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
Source: Journal of Computational and Applied Mathematics. Unidade: IME
Subjects: 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: 21 jul. 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 jul. 21 ] 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 jul. 21 ] Available from: https://doi.org/10.1016/j.cam.2022.114193
Trabalho de evento
Enhanced solution for the irregular strip packing problem: valid inequalities and branching priorities (2021)
Leão, Aline Aparecida Souza; Toledo, Franklina Maria Bragion de
Source: Anais. Conference titles: Simpósio Brasileiro de Pesquisa Operacional - SBPO. Unidade: ICMC
Subjects: PESQUISA OPERACIONAL, PROGRAMAÇÃO MISTA, EMPACOTAMENTO E COBERTURA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
LEÃO, Aline Aparecida Souza e TOLEDO, Franklina Maria Bragion de. Enhanced solution for the irregular strip packing problem: valid inequalities and branching priorities. 2021, Anais.. Rio de Janeiro: SOBRAPO, 2021. Disponível em: https://proceedings.science/sbpo-series/sbpo-2021/papers/enhanced-solution-for-the-irregular-strip-packing-problem--valid-inequalities-and-branching-priorities?lang=pt-br. Acesso em: 21 jul. 2024.
APA
Leão, A. A. S., & Toledo, F. M. B. de. (2021). Enhanced solution for the irregular strip packing problem: valid inequalities and branching priorities. In Anais. Rio de Janeiro: SOBRAPO. Recuperado de https://proceedings.science/sbpo-series/sbpo-2021/papers/enhanced-solution-for-the-irregular-strip-packing-problem--valid-inequalities-and-branching-priorities?lang=pt-br
NLM
Leão AAS, Toledo FMB de. Enhanced solution for the irregular strip packing problem: valid inequalities and branching priorities [Internet]. Anais. 2021 ;[citado 2024 jul. 21 ] Available from: https://proceedings.science/sbpo-series/sbpo-2021/papers/enhanced-solution-for-the-irregular-strip-packing-problem--valid-inequalities-and-branching-priorities?lang=pt-br
Vancouver
Leão AAS, Toledo FMB de. Enhanced solution for the irregular strip packing problem: valid inequalities and branching priorities [Internet]. Anais. 2021 ;[citado 2024 jul. 21 ] Available from: https://proceedings.science/sbpo-series/sbpo-2021/papers/enhanced-solution-for-the-irregular-strip-packing-problem--valid-inequalities-and-branching-priorities?lang=pt-br
Trabalho de evento
Modelo matemático para a determinação de kits cirúrgicos padronizados (2021)
Dias, Letícia Lemos Burla ; Santos, Maristela Oliveira dos ; Okano, Emerson Yoshiaki ; Nascimento, Mariá Cristina Vasconcelos
Source: Anais. Conference titles: Simpósio Brasileiro de Pesquisa Operacional - SBPO. Unidades: ICMC, PUSP-SC
Subjects: PLANEJAMENTO HOSPITALAR, PESQUISA OPERACIONAL, PROGRAMAÇÃO MATEMÁTICA, INSTRUMENTOS CIRÚRGICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DIAS, Letícia Lemos Burla et al. Modelo matemático para a determinação de kits cirúrgicos padronizados. 2021, Anais.. Rio de Janeiro: SOBRAPO, 2021. Disponível em: https://proceedings.science/sbpo-series/sbpo-2021/papers/modelo-matematico-para-a-determinacao-de-kits-cirurgicos-padronizados?lang=pt-br. Acesso em: 21 jul. 2024.
APA
Dias, L. L. B., Santos, M. O. dos, Okano, E. Y., & Nascimento, M. C. V. (2021). Modelo matemático para a determinação de kits cirúrgicos padronizados. In Anais. Rio de Janeiro: SOBRAPO. Recuperado de https://proceedings.science/sbpo-series/sbpo-2021/papers/modelo-matematico-para-a-determinacao-de-kits-cirurgicos-padronizados?lang=pt-br
NLM
Dias LLB, Santos MO dos, Okano EY, Nascimento MCV. Modelo matemático para a determinação de kits cirúrgicos padronizados [Internet]. Anais. 2021 ;[citado 2024 jul. 21 ] Available from: https://proceedings.science/sbpo-series/sbpo-2021/papers/modelo-matematico-para-a-determinacao-de-kits-cirurgicos-padronizados?lang=pt-br
Vancouver
Dias LLB, Santos MO dos, Okano EY, Nascimento MCV. Modelo matemático para a determinação de kits cirúrgicos padronizados [Internet]. Anais. 2021 ;[citado 2024 jul. 21 ] Available from: https://proceedings.science/sbpo-series/sbpo-2021/papers/modelo-matematico-para-a-determinacao-de-kits-cirurgicos-padronizados?lang=pt-br
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
Source: Computers and Industrial Engineering. Unidade: ICMC
Subjects: 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: 21 jul. 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 jul. 21 ] 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 jul. 21 ] Available from: https://doi.org/10.1016/j.cie.2021.107398
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
Source: Abstract Book. Conference titles: 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: 21 jul. 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 jul. 21 ] 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 jul. 21 ] Available from: https://www.euro-online.org/media_site/reports/EURO31_AB.pdf
Artigo de periodico
Special issue on recent advances in lot sizing (2021)
Akartunalı, Kerem ; Santos, Maristela Oliveira dos ; Jans, Raf ; Araujo, Silvio Alexandre de
Source: Pesquisa Operacional. Unidade: ICMC
Subjects: PESQUISA OPERACIONAL, PLANEJAMENTO DA PRODUÇÃO, REVISÃO SISTEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
AKARTUNALI, Kerem et al. Special issue on recent advances in lot sizing. Pesquisa Operacional, v. 41, n. s1, p. 1-3, 2021Tradução . . Disponível em: https://doi.org/10.1590/0101-7438.2021.041s1.0041s101. Acesso em: 21 jul. 2024.
APA
Akartunalı, K., Santos, M. O. dos, Jans, R., & Araujo, S. A. de. (2021). Special issue on recent advances in lot sizing. Pesquisa Operacional, 41( s1), 1-3. doi:10.1590/0101-7438.2021.041s1.0041s101
NLM
Akartunalı K, Santos MO dos, Jans R, Araujo SA de. Special issue on recent advances in lot sizing [Internet]. Pesquisa Operacional. 2021 ; 41( s1): 1-3.[citado 2024 jul. 21 ] Available from: https://doi.org/10.1590/0101-7438.2021.041s1.0041s101
Vancouver
Akartunalı K, Santos MO dos, Jans R, Araujo SA de. Special issue on recent advances in lot sizing [Internet]. Pesquisa Operacional. 2021 ; 41( s1): 1-3.[citado 2024 jul. 21 ] Available from: https://doi.org/10.1590/0101-7438.2021.041s1.0041s101

USP Schools

ReP

Filtros

Document Types

USP Schools

Departament

Authors

USP affiliated authors

Date published

Subjects

Source title

Publisher

Conference titles

Countries/Territories

Funding Agencies

Indexado em

Normalized affiliation

Non normalized affiliation

Countries of institutions of collaboration