Menu

Filtros : "IME" "Birgin, Ernesto Julian Goldberg" Limpar

Filtros

Refine with date range

1 - 20 (151 records)

  • 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

    Versão PublicadaAcesso à fonteDOIHow to cite
    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: 03 out. 2023.

    • 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 2023 out. 03 ] 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 2023 out. 03 ] Available from: https://doi.org/10.1016/j.eswa.2023.119866

  • Artigo de periodico

    Optimization of the first Dirichlet laplacian eigenvalue with respect to a union of balls (2023)

    Birgin, Ernesto Julian Goldberg ; Fernandez, Lucas dos Santos; Haeser, Gabriel ; Laurain, Antoine

    Source: The Journal of Geometric Analysis. Unidade: IME

    Subjects: CONTROLE ÓTIMO, EQUAÇÕES DIFERENCIAIS PARCIAIS

    Versão PublicadaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      BIRGIN, Ernesto Julian Goldberg et al. Optimization of the first Dirichlet laplacian eigenvalue with respect to a union of balls. The Journal of Geometric Analysis, v. 33, n. artigo 184, p. 1-28, 2023Tradução . . Disponível em: https://doi.org/10.1007/s12220-023-01241-w. Acesso em: 03 out. 2023.

    • APA

      Birgin, E. J. G., Fernandez, L. dos S., Haeser, G., & Laurain, A. (2023). Optimization of the first Dirichlet laplacian eigenvalue with respect to a union of balls. The Journal of Geometric Analysis, 33( artigo 184), 1-28. doi:10.1007/s12220-023-01241-w

    • NLM

      Birgin EJG, Fernandez L dos S, Haeser G, Laurain A. Optimization of the first Dirichlet laplacian eigenvalue with respect to a union of balls [Internet]. The Journal of Geometric Analysis. 2023 ; 33( artigo 184): 1-28.[citado 2023 out. 03 ] Available from: https://doi.org/10.1007/s12220-023-01241-w

    • Vancouver

      Birgin EJG, Fernandez L dos S, Haeser G, Laurain A. Optimization of the first Dirichlet laplacian eigenvalue with respect to a union of balls [Internet]. The Journal of Geometric Analysis. 2023 ; 33( artigo 184): 1-28.[citado 2023 out. 03 ] Available from: https://doi.org/10.1007/s12220-023-01241-w

  • Artigo de periodico

    Bounds on the optimal radius when covering a set with minimum radius identical disks (2023)

    Birgin, Ernesto Julian Goldberg ; Gardenghi, John Lenon Cardoso ; Laurain, Antoine

    Source: Mathematics of Operations Research. Unidade: IME

    Subjects: CÁLCULO DE VARIAÇÕES, CONTROLE ÓTIMO

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      BIRGIN, Ernesto Julian Goldberg e GARDENGHI, John Lenon Cardoso e LAURAIN, Antoine. Bounds on the optimal radius when covering a set with minimum radius identical disks. Mathematics of Operations Research, 2023Tradução . . Disponível em: https://doi.org/10.1287/moor.2022.0104. Acesso em: 03 out. 2023.

    • APA

      Birgin, E. J. G., Gardenghi, J. L. C., & Laurain, A. (2023). Bounds on the optimal radius when covering a set with minimum radius identical disks. Mathematics of Operations Research. doi:10.1287/moor.2022.0104

    • NLM

      Birgin EJG, Gardenghi JLC, Laurain A. Bounds on the optimal radius when covering a set with minimum radius identical disks [Internet]. Mathematics of Operations Research. 2023 ;[citado 2023 out. 03 ] Available from: https://doi.org/10.1287/moor.2022.0104

    • Vancouver

      Birgin EJG, Gardenghi JLC, Laurain A. Bounds on the optimal radius when covering a set with minimum radius identical disks [Internet]. Mathematics of Operations Research. 2023 ;[citado 2023 out. 03 ] Available from: https://doi.org/10.1287/moor.2022.0104

  • Artigo de periodico

    Relax-and-fix heuristics applied to a real-world lot sizing and scheduling problem in the personal care consumer goods industry (2023)

    Araujo, Kennedy Anderson Guimarães de ; Birgin, Ernesto Julian Goldberg ; Kawamura, M. S.; Ronconi, Débora Pretti

    Source: Operations Research Forum. Unidades: IME, EP

    Subjects: PROGRAMAÇÃO LINEAR, CONTROLE DA PRODUÇÃO, PLANEJAMENTO DA PRODUÇÃO

    Versão PublicadaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      ARAUJO, Kennedy Anderson Guimarães de et al. Relax-and-fix heuristics applied to a real-world lot sizing and scheduling problem in the personal care consumer goods industry. Operations Research Forum, v. 4, n. artigo 47, p. 1-30, 2023Tradução . . Disponível em: https://doi.org/10.1007/s43069-023-00230-7. Acesso em: 03 out. 2023.

    • APA

      Araujo, K. A. G. de, Birgin, E. J. G., Kawamura, M. S., & Ronconi, D. P. (2023). Relax-and-fix heuristics applied to a real-world lot sizing and scheduling problem in the personal care consumer goods industry. Operations Research Forum, 4( artigo 47), 1-30. doi:10.1007/s43069-023-00230-7

    • NLM

      Araujo KAG de, Birgin EJG, Kawamura MS, Ronconi DP. Relax-and-fix heuristics applied to a real-world lot sizing and scheduling problem in the personal care consumer goods industry [Internet]. Operations Research Forum. 2023 ; 4( artigo 47): 1-30.[citado 2023 out. 03 ] Available from: https://doi.org/10.1007/s43069-023-00230-7

    • Vancouver

      Araujo KAG de, Birgin EJG, Kawamura MS, Ronconi DP. Relax-and-fix heuristics applied to a real-world lot sizing and scheduling problem in the personal care consumer goods industry [Internet]. Operations Research Forum. 2023 ; 4( artigo 47): 1-30.[citado 2023 out. 03 ] Available from: https://doi.org/10.1007/s43069-023-00230-7

  • Artigo de periodico

    Sensitivity analysis and tailored design of minimization diagrams (2023)

    Birgin, Ernesto Julian Goldberg ; Laurain, Antoine ; Menezes, Tiago da Costa

    Source: Mathematics of Computation. Unidade: IME

    Subjects: CÁLCULO DE VARIAÇÕES, CONTROLE ÓTIMO

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      BIRGIN, Ernesto Julian Goldberg e LAURAIN, Antoine e MENEZES, Tiago da Costa. Sensitivity analysis and tailored design of minimization diagrams. Mathematics of Computation, v. 92, p. 2715-2768, 2023Tradução . . Disponível em: https://doi.org/10.1090/mcom/3839. Acesso em: 03 out. 2023.

    • APA

      Birgin, E. J. G., Laurain, A., & Menezes, T. da C. (2023). Sensitivity analysis and tailored design of minimization diagrams. Mathematics of Computation, 92, 2715-2768. doi:10.1090/mcom/3839

    • NLM

      Birgin EJG, Laurain A, Menezes T da C. Sensitivity analysis and tailored design of minimization diagrams [Internet]. Mathematics of Computation. 2023 ; 92 2715-2768.[citado 2023 out. 03 ] Available from: https://doi.org/10.1090/mcom/3839

    • Vancouver

      Birgin EJG, Laurain A, Menezes T da C. Sensitivity analysis and tailored design of minimization diagrams [Internet]. Mathematics of Computation. 2023 ; 92 2715-2768.[citado 2023 out. 03 ] Available from: https://doi.org/10.1090/mcom/3839

  • Dissertação (Mestrado)

    Uma abordagem contínua para o problema do caixeiro viajante (2023)

    Ertel, Paula Cristina Rohr; Birgin, Ernesto Julian Goldberg (Orientador)

    Unidade: IME

    Subjects: HEURÍSTICA, ALGORITMOS GENÉTICOS

    Acesso à fonteAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      ERTEL, Paula Cristina Rohr. Uma abordagem contínua para o problema do caixeiro viajante. 2023. Dissertação (Mestrado) – Universidade de São Paulo, São Paulo, 2023. Disponível em: https://www.teses.usp.br/teses/disponiveis/45/45132/tde-27042023-223742/. Acesso em: 03 out. 2023.

    • APA

      Ertel, P. C. R. (2023). Uma abordagem contínua para o problema do caixeiro viajante (Dissertação (Mestrado). Universidade de São Paulo, São Paulo. Recuperado de https://www.teses.usp.br/teses/disponiveis/45/45132/tde-27042023-223742/

    • NLM

      Ertel PCR. Uma abordagem contínua para o problema do caixeiro viajante [Internet]. 2023 ;[citado 2023 out. 03 ] Available from: https://www.teses.usp.br/teses/disponiveis/45/45132/tde-27042023-223742/

    • Vancouver

      Ertel PCR. Uma abordagem contínua para o problema do caixeiro viajante [Internet]. 2023 ;[citado 2023 out. 03 ] Available from: https://www.teses.usp.br/teses/disponiveis/45/45132/tde-27042023-223742/

  • Artigo de periodico

    Accelerated derivative-free nonlinear least-squares applied to the estimation of Manning coefficients (2022)

    Birgin, Ernesto Julian Goldberg ; Martínez, José Mário

    Source: Computational Optimization and Applications. Unidade: IME

    Subjects: INTERPOLAÇÃO, MÉTODOS ITERATIVOS, APROXIMAÇÃO POR MÍNIMOS QUADRADOS, MÉTODOS NUMÉRICOS

    PrivadoAcesso à fonteDOIHow to cite
    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. Accelerated derivative-free nonlinear least-squares applied to the estimation of Manning coefficients. Computational Optimization and Applications, v. 81, p. 689–715, 2022Tradução . . Disponível em: https://doi.org/10.1007/s10589-021-00344-w. Acesso em: 03 out. 2023.

    • APA

      Birgin, E. J. G., & Martínez, J. M. (2022). Accelerated derivative-free nonlinear least-squares applied to the estimation of Manning coefficients. Computational Optimization and Applications, 81, 689–715. doi:10.1007/s10589-021-00344-w

    • NLM

      Birgin EJG, Martínez JM. Accelerated derivative-free nonlinear least-squares applied to the estimation of Manning coefficients [Internet]. Computational Optimization and Applications. 2022 ; 81 689–715.[citado 2023 out. 03 ] Available from: https://doi.org/10.1007/s10589-021-00344-w

    • Vancouver

      Birgin EJG, Martínez JM. Accelerated derivative-free nonlinear least-squares applied to the estimation of Manning coefficients [Internet]. Computational Optimization and Applications. 2022 ; 81 689–715.[citado 2023 out. 03 ] Available from: https://doi.org/10.1007/s10589-021-00344-w

  • Artigo de periodico

    A Shape-Newton approach to the problem of covering with identical balls (2022)

    Birgin, Ernesto Julian Goldberg ; Laurain, Antoine ; Massambone, Rafael ; Santana, Arthur G.

    Source: SIAM Journal on Scientific Computing. Unidade: IME

    Subjects: OTIMIZAÇÃO MATEMÁTICA, EMPACOTAMENTO E COBERTURA

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      BIRGIN, Ernesto Julian Goldberg et al. A Shape-Newton approach to the problem of covering with identical balls. SIAM Journal on Scientific Computing, v. 44, n. 2, p. A798-A824, 2022Tradução . . Disponível em: https://doi.org/10.1137/21M1426067. Acesso em: 03 out. 2023.

    • APA

      Birgin, E. J. G., Laurain, A., Massambone, R., & Santana, A. G. (2022). A Shape-Newton approach to the problem of covering with identical balls. SIAM Journal on Scientific Computing, 44( 2), A798-A824. doi:10.1137/21M1426067

    • NLM

      Birgin EJG, Laurain A, Massambone R, Santana AG. A Shape-Newton approach to the problem of covering with identical balls [Internet]. SIAM Journal on Scientific Computing. 2022 ; 44( 2): A798-A824.[citado 2023 out. 03 ] Available from: https://doi.org/10.1137/21M1426067

    • Vancouver

      Birgin EJG, Laurain A, Massambone R, Santana AG. A Shape-Newton approach to the problem of covering with identical balls [Internet]. SIAM Journal on Scientific Computing. 2022 ; 44( 2): A798-A824.[citado 2023 out. 03 ] Available from: https://doi.org/10.1137/21M1426067

  • Artigo de periodico

    On the complexity of solving feasibility problems with regularized models (2022)

    Birgin, Ernesto Julian Goldberg ; Bueno, Luís Felipe ; Martínez, José Mário

    Source: Optimization Methods and Software. Unidade: IME

    Subjects: PROGRAMAÇÃO LINEAR, PROGRAMAÇÃO MATEMÁTICA MÉTODOS

    Versão PublicadaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      BIRGIN, Ernesto Julian Goldberg e BUENO, Luís Felipe e MARTÍNEZ, José Mário. On the complexity of solving feasibility problems with regularized models. Optimization Methods and Software, v. 37, p. 405-424, 2022Tradução . . Disponível em: https://doi.org/10.1080/10556788.2020.1786564. Acesso em: 03 out. 2023.

    • APA

      Birgin, E. J. G., Bueno, L. F., & Martínez, J. M. (2022). On the complexity of solving feasibility problems with regularized models. Optimization Methods and Software, 37, 405-424. doi:10.1080/10556788.2020.1786564

    • NLM

      Birgin EJG, Bueno LF, Martínez JM. On the complexity of solving feasibility problems with regularized models [Internet]. Optimization Methods and Software. 2022 ; 37 405-424.[citado 2023 out. 03 ] Available from: https://doi.org/10.1080/10556788.2020.1786564

    • Vancouver

      Birgin EJG, Bueno LF, Martínez JM. On the complexity of solving feasibility problems with regularized models [Internet]. Optimization Methods and Software. 2022 ; 37 405-424.[citado 2023 out. 03 ] Available from: https://doi.org/10.1080/10556788.2020.1786564

  • 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

    Acesso à fonteDOIHow to cite
    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: 03 out. 2023.

    • 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 2023 out. 03 ] 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 2023 out. 03 ] 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

    Versão PublicadaAcesso à fonteDOIHow to cite
    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: 03 out. 2023.

    • 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 2023 out. 03 ] 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 2023 out. 03 ] Available from: https://doi.org/10.1007/s10898-022-01168-6

  • Dissertação (Mestrado)

    Cobertura com círculos de raio mínimo (2022)

    Santana, Arthur Gabriel de; Birgin, Ernesto Julian Goldberg (Orientador)

    Unidade: IME

    Assunto: ALGORITMOS

    Acesso à fonteAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      SANTANA, Arthur Gabriel de. Cobertura com círculos de raio mínimo. 2022. Dissertação (Mestrado) – Universidade de São Paulo, São Paulo, 2022. Disponível em: https://www.teses.usp.br/teses/disponiveis/45/45134/tde-30032022-172201/. Acesso em: 03 out. 2023.

    • APA

      Santana, A. G. de. (2022). Cobertura com círculos de raio mínimo (Dissertação (Mestrado). Universidade de São Paulo, São Paulo. Recuperado de https://www.teses.usp.br/teses/disponiveis/45/45134/tde-30032022-172201/

    • NLM

      Santana AG de. Cobertura com círculos de raio mínimo [Internet]. 2022 ;[citado 2023 out. 03 ] Available from: https://www.teses.usp.br/teses/disponiveis/45/45134/tde-30032022-172201/

    • Vancouver

      Santana AG de. Cobertura com círculos de raio mínimo [Internet]. 2022 ;[citado 2023 out. 03 ] Available from: https://www.teses.usp.br/teses/disponiveis/45/45134/tde-30032022-172201/

  • Artigo de periodico

    Block coordinate descent for smooth nonconvex constrained minimization (2022)

    Birgin, Ernesto Julian Goldberg ; Martínez, José Mário

    Source: Computational Optimization and Applications. Unidade: IME

    Subjects: PROGRAMAÇÃO NÃO LINEAR, PESQUISA OPERACIONAL, ANÁLISE NUMÉRICA, CÁLCULO DE VARIAÇÕES, MÉTODOS NUMÉRICOS, CIÊNCIA DA COMPUTAÇÃO

    Versão PublicadaAcesso à fonteDOIHow to cite
    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. Computational Optimization and Applications, v. 83, p. 1-27, 2022Tradução . . Disponível em: https://doi.org/10.1007/s10589-022-00389-5. Acesso em: 03 out. 2023.

    • APA

      Birgin, E. J. G., & Martínez, J. M. (2022). Block coordinate descent for smooth nonconvex constrained minimization. Computational Optimization and Applications, 83, 1-27. doi:10.1007/s10589-022-00389-5

    • NLM

      Birgin EJG, Martínez JM. Block coordinate descent for smooth nonconvex constrained minimization [Internet]. Computational Optimization and Applications. 2022 ; 83 1-27.[citado 2023 out. 03 ] Available from: https://doi.org/10.1007/s10589-022-00389-5

    • Vancouver

      Birgin EJG, Martínez JM. Block coordinate descent for smooth nonconvex constrained minimization [Internet]. Computational Optimization and Applications. 2022 ; 83 1-27.[citado 2023 out. 03 ] Available from: https://doi.org/10.1007/s10589-022-00389-5

  • 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

    Versão PublicadaAcesso à fonteDOIHow to cite
    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: 03 out. 2023.

    • 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 2023 out. 03 ] 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 2023 out. 03 ] Available from: https://doi.org/10.1016/j.cam.2022.114193

  • Artigo de periodico

    A shape optimization approach to the problem of covering a two-dimensional region with minimum-radius identical balls (2021)

    Birgin, Ernesto Julian Goldberg ; Laurain, Antoine ; Massambone, Rafael ; Santana, Arthur Gabriel

    Source: SIAM Journal on Scientific Computing. Unidade: IME

    Subjects: CÁLCULO DE VARIAÇÕES, PROGRAMAÇÃO NÃO LINEAR

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      BIRGIN, Ernesto Julian Goldberg et al. A shape optimization approach to the problem of covering a two-dimensional region with minimum-radius identical balls. SIAM Journal on Scientific Computing, v. 43, n. 3, p. A2047-A2078, 2021Tradução . . Disponível em: https://doi.org/10.1137/20M135950X. Acesso em: 03 out. 2023.

    • APA

      Birgin, E. J. G., Laurain, A., Massambone, R., & Santana, A. G. (2021). A shape optimization approach to the problem of covering a two-dimensional region with minimum-radius identical balls. SIAM Journal on Scientific Computing, 43( 3), A2047-A2078. doi:10.1137/20M135950X

    • NLM

      Birgin EJG, Laurain A, Massambone R, Santana AG. A shape optimization approach to the problem of covering a two-dimensional region with minimum-radius identical balls [Internet]. SIAM Journal on Scientific Computing. 2021 ; 43( 3): A2047-A2078.[citado 2023 out. 03 ] Available from: https://doi.org/10.1137/20M135950X

    • Vancouver

      Birgin EJG, Laurain A, Massambone R, Santana AG. A shape optimization approach to the problem of covering a two-dimensional region with minimum-radius identical balls [Internet]. SIAM Journal on Scientific Computing. 2021 ; 43( 3): A2047-A2078.[citado 2023 out. 03 ] Available from: https://doi.org/10.1137/20M135950X

  • Artigo de periodico

    On the solution of linearly constrained optimization problems by means of barrier algorithms (2021)

    Birgin, Ernesto Julian Goldberg ; Gardenghi, John Lenon Cardoso ; Martínez, José Mário ; Santos, S. A

    Source: TOP. Unidade: IME

    Subjects: PROGRAMAÇÃO NÃO LINEAR, PROGRAMAÇÃO MATEMÁTICA

    Versão AceitaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      BIRGIN, Ernesto Julian Goldberg et al. On the solution of linearly constrained optimization problems by means of barrier algorithms. TOP, v. 29, n. 2, p. 417-441, 2021Tradução . . Disponível em: https://doi.org/10.1007/s11750-020-00559-w. Acesso em: 03 out. 2023.

    • APA

      Birgin, E. J. G., Gardenghi, J. L. C., Martínez, J. M., & Santos, S. A. (2021). On the solution of linearly constrained optimization problems by means of barrier algorithms. TOP, 29( 2), 417-441. doi:10.1007/s11750-020-00559-w

    • NLM

      Birgin EJG, Gardenghi JLC, Martínez JM, Santos SA. On the solution of linearly constrained optimization problems by means of barrier algorithms [Internet]. TOP. 2021 ; 29( 2): 417-441.[citado 2023 out. 03 ] Available from: https://doi.org/10.1007/s11750-020-00559-w

    • Vancouver

      Birgin EJG, Gardenghi JLC, Martínez JM, Santos SA. On the solution of linearly constrained optimization problems by means of barrier algorithms [Internet]. TOP. 2021 ; 29( 2): 417-441.[citado 2023 out. 03 ] Available from: https://doi.org/10.1007/s11750-020-00559-w

  • Artigo de periodico

    On constrained optimization with nonconvex regularization (2021)

    Birgin, Ernesto Julian Goldberg ; Martínez, José Mário ; Ramos, Alberto

    Source: Numerical Algorithms. Unidade: IME

    Subjects: OTIMIZAÇÃO NÃO LINEAR, COMPUTABILIDADE E COMPLEXIDADE

    Versão AceitaAcesso à fonteDOIHow to cite
    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 RAMOS, Alberto. On constrained optimization with nonconvex regularization. Numerical Algorithms, v. 86, n. 3, p. 1165-1188, 2021Tradução . . Disponível em: http://dx.doi.org/10.1007/s11075-020-00928-3. Acesso em: 03 out. 2023.

    • APA

      Birgin, E. J. G., Martínez, J. M., & Ramos, A. (2021). On constrained optimization with nonconvex regularization. Numerical Algorithms, 86( 3), 1165-1188. doi:10.1007/s11075-020-00928-3

    • NLM

      Birgin EJG, Martínez JM, Ramos A. On constrained optimization with nonconvex regularization [Internet]. Numerical Algorithms. 2021 ; 86( 3): 1165-1188.[citado 2023 out. 03 ] Available from: http://dx.doi.org/10.1007/s11075-020-00928-3

    • Vancouver

      Birgin EJG, Martínez JM, Ramos A. On constrained optimization with nonconvex regularization [Internet]. Numerical Algorithms. 2021 ; 86( 3): 1165-1188.[citado 2023 out. 03 ] Available from: http://dx.doi.org/10.1007/s11075-020-00928-3

  • Artigo de periodico

    Metaheuristics for the online printing shop scheduling problem (2021)

    Lunardi, Willian Tessaro ; Birgin, Ernesto Julian Goldberg ; Ronconi, Débora Pretti ; Voos, Holger

    Source: European Journal of Operational Research. Unidades: IME, EP

    Subjects: PROGRAMAÇÃO MATEMÁTICA, SCHEDULING

    Versão AceitaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      LUNARDI, Willian Tessaro et al. Metaheuristics for the online printing shop scheduling problem. European Journal of Operational Research, v. 293, n. 2, p. 419-441, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2020.12.021. Acesso em: 03 out. 2023.

    • APA

      Lunardi, W. T., Birgin, E. J. G., Ronconi, D. P., & Voos, H. (2021). Metaheuristics for the online printing shop scheduling problem. European Journal of Operational Research, 293( 2), 419-441. doi:10.1016/j.ejor.2020.12.021

    • NLM

      Lunardi WT, Birgin EJG, Ronconi DP, Voos H. Metaheuristics for the online printing shop scheduling problem [Internet]. European Journal of Operational Research. 2021 ; 293( 2): 419-441.[citado 2023 out. 03 ] Available from: https://doi.org/10.1016/j.ejor.2020.12.021

    • Vancouver

      Lunardi WT, Birgin EJG, Ronconi DP, Voos H. Metaheuristics for the online printing shop scheduling problem [Internet]. European Journal of Operational Research. 2021 ; 293( 2): 419-441.[citado 2023 out. 03 ] Available from: https://doi.org/10.1016/j.ejor.2020.12.021

  • Artigo de periodico

    On the use of third-order models with fourth-order regularization for unconstrained optimization (2020)

    Birgin, Ernesto Julian Goldberg ; Gardenghi, John Lenon Cardoso ; Martínez, José Mário ; Santos, Sandra Augusta

    Source: Optimization Letters. Unidade: IME

    Assunto: OTIMIZAÇÃO MATEMÁTICA

    Versão AceitaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      BIRGIN, Ernesto Julian Goldberg et al. On the use of third-order models with fourth-order regularization for unconstrained optimization. Optimization Letters, v. 14, n. 4, p. 815-838, 2020Tradução . . Disponível em: http://dx.doi.org/10.1007/s11590-019-01395-z. Acesso em: 03 out. 2023.

    • APA

      Birgin, E. J. G., Gardenghi, J. L. C., Martínez, J. M., & Santos, S. A. (2020). On the use of third-order models with fourth-order regularization for unconstrained optimization. Optimization Letters, 14( 4), 815-838. doi:10.1007/s11590-019-01395-z

    • NLM

      Birgin EJG, Gardenghi JLC, Martínez JM, Santos SA. On the use of third-order models with fourth-order regularization for unconstrained optimization [Internet]. Optimization Letters. 2020 ; 14( 4): 815-838.[citado 2023 out. 03 ] Available from: http://dx.doi.org/10.1007/s11590-019-01395-z

    • Vancouver

      Birgin EJG, Gardenghi JLC, Martínez JM, Santos SA. On the use of third-order models with fourth-order regularization for unconstrained optimization [Internet]. Optimization Letters. 2020 ; 14( 4): 815-838.[citado 2023 out. 03 ] Available from: http://dx.doi.org/10.1007/s11590-019-01395-z

  • Artigo de periodico

    A filtered beam search method for the m-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs (2020)

    Birgin, Ernesto Julian Goldberg ; Jesus Filho, José Eurípedes Ferreira de; Ronconi, Débora Pretti

    Source: Computers & Operations Research. Unidades: IME, EP

    Subjects: ALGORITMOS DE SCHEDULING, HEURÍSTICA, PROGRAMAÇÃO DA PRODUÇÃO

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      BIRGIN, Ernesto Julian Goldberg e JESUS FILHO, José Eurípedes Ferreira de e RONCONI, Débora Pretti. A filtered beam search method for the m-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs. Computers & Operations Research, v. 114, n. 1-14, p. 104824, 2020Tradução . . Disponível em: http://dx.doi.org/10.1016/j.cor.2019.104824. Acesso em: 03 out. 2023.

    • APA

      Birgin, E. J. G., Jesus Filho, J. E. F. de, & Ronconi, D. P. (2020). A filtered beam search method for the m-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs. Computers & Operations Research, 114( 1-14), 104824. doi:10.1016/j.cor.2019.104824

    • NLM

      Birgin EJG, Jesus Filho JEF de, Ronconi DP. A filtered beam search method for the m-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs [Internet]. Computers & Operations Research. 2020 ; 114( 1-14): 104824.[citado 2023 out. 03 ] Available from: http://dx.doi.org/10.1016/j.cor.2019.104824

    • Vancouver

      Birgin EJG, Jesus Filho JEF de, Ronconi DP. A filtered beam search method for the m-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs [Internet]. Computers & Operations Research. 2020 ; 114( 1-14): 104824.[citado 2023 out. 03 ] Available from: http://dx.doi.org/10.1016/j.cor.2019.104824

1 - 20 (151 records)

Digital Library of Intellectual Production of Universidade de São Paulo     2012 - 2023