Filters : "BIRGIN, ERNESTO JULIAN GOLDBERG" Limpar

Filters



Refine with date range


  • Source: Computational Optimization and Applications. Unidade: IME

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

    PrivateOnline source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BIRGIN, Ernesto Julian Goldberg; MARTÍNEZ, José Mário. Accelerated derivative-free nonlinear least-squares applied to the estimation of Manning coefficients. Computational Optimization and Applications, Dordrecht, v. 81, p. 689–715, 2022. Disponível em: < https://doi.org/10.1007/s10589-021-00344-w > DOI: 10.1007/s10589-021-00344-w.
    • 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.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.Available from: https://doi.org/10.1007/s10589-021-00344-w
  • Source: SIAM Journal on Scientific Computing. Unidade: IME

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

    Online source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BIRGIN, Ernesto Julian Goldberg; LAURAIN, Antoine; MASSAMBONE, Rafael; SANTANA, Arthur G. A Shape-Newton approach to the problem of covering with identical balls. SIAM Journal on Scientific Computing, Philadelphia, v. 44, n. 2, p. A798-A824, 2022. Disponível em: < https://doi.org/10.1137/21M1426067 > DOI: 10.1137/21M1426067.
    • 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.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.Available from: https://doi.org/10.1137/21M1426067
  • Source: SIAM Journal on Scientific Computing. Unidade: IME

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

    Online source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BIRGIN, Ernesto Julian Goldberg; LAURAIN, Antoine; MASSAMBONE, Rafael; SANTANA, Arthur Gabriel. A shape optimization approach to the problem of covering a two-dimensional region with minimum-radius identical balls. SIAM Journal on Scientific Computing, Philadelphia, v. 43, n. 3, p. A2047-A2078, 2021. Disponível em: < https://doi.org/10.1137/20M135950X > DOI: 10.1137/20M135950X.
    • 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.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.Available from: https://doi.org/10.1137/20M135950X
  • Source: TOP. Unidade: IME

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

    Versão AceitaOnline source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BIRGIN, Ernesto Julian Goldberg; GARDENGHI, John Lenon Cardoso; MARTÍNEZ, José Mário; SANTOS, S. A. On the solution of linearly constrained optimization problems by means of barrier algorithms. TOP, Heidelberg, v. 29, n. 2, p. 417-441, 2021. Disponível em: < https://doi.org/10.1007/s11750-020-00559-w > DOI: 10.1007/s11750-020-00559-w.
    • 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.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.Available from: https://doi.org/10.1007/s11750-020-00559-w
  • Source: European Journal of Operational Research. Unidades: IME, EP

    Subjects: PROGRAMAÇÃO MATEMÁTICA, SCHEDULING

    Versão AceitaOnline source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      LUNARDI, Willian Tessaro; BIRGIN, Ernesto Julian Goldberg; RONCONI, Débora Pretti; VOOS, Holger. Metaheuristics for the online printing shop scheduling problem. European Journal of Operational Research, Amsterdam, v. 293, n. 2, p. 419-441, 2021. Disponível em: < https://doi.org/10.1016/j.ejor.2020.12.021 > DOI: 10.1016/j.ejor.2020.12.021.
    • 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.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.Available from: https://doi.org/10.1016/j.ejor.2020.12.021
  • Source: Numerical Algorithms. Unidade: IME

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

    Versão AceitaOnline source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BIRGIN, Ernesto Julian Goldberg; MARTÍNEZ, José Mário; RAMOS, Alberto. On constrained optimization with nonconvex regularization. Numerical Algorithms, Bussum, v. 86, n. 3, p. 1165-1188, 2021. Disponível em: < http://dx.doi.org/10.1007/s11075-020-00928-3 > DOI: 10.1007/s11075-020-00928-3.
    • 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.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.Available from: http://dx.doi.org/10.1007/s11075-020-00928-3
  • Source: Computational Optimization and Applications. Unidade: IME

    Subject: OTIMIZAÇÃO MATEMÁTICA

    Versão AceitaOnline source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BIRGIN, Ernesto Julian Goldberg. Preface of the special issue dedicated to the XII Brazilian workshop on continuous optimization. [Editorial]. Computational Optimization and Applications[S.l: s.n.], 2020.Disponível em: DOI: 10.1007/s10589-020-00203-0.
    • APA

      Birgin, E. J. G. (2020). Preface of the special issue dedicated to the XII Brazilian workshop on continuous optimization. [Editorial]. Computational Optimization and Applications. New York. doi:10.1007/s10589-020-00203-0
    • NLM

      Birgin EJG. Preface of the special issue dedicated to the XII Brazilian workshop on continuous optimization. [Editorial] [Internet]. Computational Optimization and Applications. 2020 ; 76( 3): 615-619.Available from: http://dx.doi.org/10.1007/s10589-020-00203-0
    • Vancouver

      Birgin EJG. Preface of the special issue dedicated to the XII Brazilian workshop on continuous optimization. [Editorial] [Internet]. Computational Optimization and Applications. 2020 ; 76( 3): 615-619.Available from: http://dx.doi.org/10.1007/s10589-020-00203-0
  • Source: Optimization Methods and Software. Unidade: IME

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

    Versão AceitaOnline source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BIRGIN, Ernesto Julian Goldberg; BUENO, Luís Felipe; MARTÍNEZ, José Mário. On the complexity of solving feasibility problems with regularized models. Optimization Methods and Software, Reading, 2020. Disponível em: < https://doi.org/10.1080/10556788.2020.1786564 > DOI: 10.1080/10556788.2020.1786564.
    • APA

      Birgin, E. J. G., Bueno, L. F., & Martínez, J. M. (2020). On the complexity of solving feasibility problems with regularized models. Optimization Methods and Software. 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. 2020 ;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. 2020 ;Available from: https://doi.org/10.1080/10556788.2020.1786564
  • Source: International Transactions in Operational Research. Unidade: IME

    Subjects: PROGRAMAÇÃO MATEMÁTICA, MATEMÁTICA DA COMPUTAÇÃO

    Versão AceitaOnline source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      MARTIN, Mateus; BIRGIN, Ernesto Julian Goldberg; LOBATO, Rafael Durbano; MORABITO, Reinaldo; MUNARI, Pedro. Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern. International Transactions in Operational Research, Oxford, v. 27, n. 2, p. 767-793, 2020. Disponível em: < http://dx.doi.org/10.1111/itor.12703 > DOI: 10.1111/itor.12703.
    • APA

      Martin, M., Birgin, E. J. G., Lobato, R. D., Morabito, R., & Munari, P. (2020). Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern. International Transactions in Operational Research, 27( 2), 767-793. doi:10.1111/itor.12703
    • NLM

      Martin M, Birgin EJG, Lobato RD, Morabito R, Munari P. Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern [Internet]. International Transactions in Operational Research. 2020 ; 27( 2): 767-793.Available from: http://dx.doi.org/10.1111/itor.12703
    • Vancouver

      Martin M, Birgin EJG, Lobato RD, Morabito R, Munari P. Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern [Internet]. International Transactions in Operational Research. 2020 ; 27( 2): 767-793.Available from: http://dx.doi.org/10.1111/itor.12703
  • Source: Computational and Applied Mathematics. Unidade: IME

    Subjects: PROGRAMAÇÃO NÃO LINEAR, GEOMETRIA ALGÉBRICA

    Versão AceitaOnline source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BIRGIN, Ernesto Julian Goldberg; GÓMEZ, Walter; HAESER, Gabriel; MITO, Leonardo Makoto; SANTOS, Daiana O. An Augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem. Computational and Applied Mathematics, Heidelberg, v. 39, 2020. Disponível em: < https://doi.org/10.1007/s40314-019-0991-5 > DOI: 10.1007/s40314-019-0991-5.
    • APA

      Birgin, E. J. G., Gómez, W., Haeser, G., Mito, L. M., & Santos, D. O. (2020). An Augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem. Computational and Applied Mathematics, 39. doi:10.1007/s40314-019-0991-5
    • NLM

      Birgin EJG, Gómez W, Haeser G, Mito LM, Santos DO. An Augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem [Internet]. Computational and Applied Mathematics. 2020 ; 39Available from: https://doi.org/10.1007/s40314-019-0991-5
    • Vancouver

      Birgin EJG, Gómez W, Haeser G, Mito LM, Santos DO. An Augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem [Internet]. Computational and Applied Mathematics. 2020 ; 39Available from: https://doi.org/10.1007/s40314-019-0991-5
  • Source: Optimization Letters. Unidade: IME

    Subject: OTIMIZAÇÃO MATEMÁTICA

    Versão AceitaOnline source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BIRGIN, Ernesto Julian Goldberg; GARDENGHI, John Lenon Cardoso; MARTÍNEZ, José Mário; SANTOS, Sandra Augusta. On the use of third-order models with fourth-order regularization for unconstrained optimization. Optimization Letters, Heidelberg, v. 14, n. 4, p. 815-838, 2020. Disponível em: < http://dx.doi.org/10.1007/s11590-019-01395-z > DOI: 10.1007/s11590-019-01395-z.
    • 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.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.Available from: http://dx.doi.org/10.1007/s11590-019-01395-z
  • Source: Computers & Operations Research. Unidades: IME, EP

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

    PrivateOnline source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BIRGIN, Ernesto Julian Goldberg; JESUS FILHO, José Eurípedes Ferreira de; 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, Oxford, v. 114, n. 1-14, p. 104824, 2020. Disponível em: < http://dx.doi.org/10.1016/j.cor.2019.104824 > DOI: 10.1016/j.cor.2019.104824.
    • 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.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.Available from: http://dx.doi.org/10.1016/j.cor.2019.104824
  • Source: International Transactions in Operational Research. Unidades: IME, EP

    Subject: PROGRAMAÇÃO LINEAR

    Versão AceitaOnline source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BIRGIN, Ernesto Julian Goldberg; ROMÃO, Oberlan Christo; RONCONI, Débora Pretti. The multiperiod two-dimensional non-guillotine cutting stock problem with usable leftovers. International Transactions in Operational Research, Oxford, v. 27, n. 3, p. 1392-1418, 2020. Disponível em: < http://dx.doi.org/10.1111/itor.12648 > DOI: 10.1111/itor.12648.
    • APA

      Birgin, E. J. G., Romão, O. C., & Ronconi, D. P. (2020). The multiperiod two-dimensional non-guillotine cutting stock problem with usable leftovers. International Transactions in Operational Research, 27( 3), 1392-1418. doi:10.1111/itor.12648
    • NLM

      Birgin EJG, Romão OC, Ronconi DP. The multiperiod two-dimensional non-guillotine cutting stock problem with usable leftovers [Internet]. International Transactions in Operational Research. 2020 ; 27( 3): 1392-1418.Available from: http://dx.doi.org/10.1111/itor.12648
    • Vancouver

      Birgin EJG, Romão OC, Ronconi DP. The multiperiod two-dimensional non-guillotine cutting stock problem with usable leftovers [Internet]. International Transactions in Operational Research. 2020 ; 27( 3): 1392-1418.Available from: http://dx.doi.org/10.1111/itor.12648
  • Unidade: IME

    Subject: CIÊNCIA DA COMPUTAÇÃO

    Online source accessHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BIRGIN, Ernesto Julian Goldberg. Computational optimization and applications. [S.l: s.n.], 2020.Disponível em: .
    • APA

      Birgin, E. J. G. (2020). Computational optimization and applications. New York: Springer. Recuperado de https://link.springer.com/journal/10589/volumes-and-issues/76-3
    • NLM

      Birgin EJG. Computational optimization and applications [Internet]. 2020 ; 76( 3):Available from: https://link.springer.com/journal/10589/volumes-and-issues/76-3
    • Vancouver

      Birgin EJG. Computational optimization and applications [Internet]. 2020 ; 76( 3):Available from: https://link.springer.com/journal/10589/volumes-and-issues/76-3
  • Source: Optimization Methods and Software. Unidade: IME

    Subjects: PROGRAMAÇÃO NÃO LINEAR, PROGRAMAÇÃO MATEMÁTICA, ANÁLISE DE ALGORITMOS

    Versão AceitaOnline source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BIRGIN, Ernesto Julian Goldberg; MARTÍNEZ, José Mário. Complexity and performance of an Augmented Lagrangian algorithm. Optimization Methods and Software, Reading, v. 35, n. 5, p. 885-920, 2020. Disponível em: < http://dx.doi.org/10.1080/10556788.2020.1746962 > DOI: 10.1080/10556788.2020.1746962.
    • APA

      Birgin, E. J. G., & Martínez, J. M. (2020). Complexity and performance of an Augmented Lagrangian algorithm. Optimization Methods and Software, 35( 5), 885-920. doi:10.1080/10556788.2020.1746962
    • NLM

      Birgin EJG, Martínez JM. Complexity and performance of an Augmented Lagrangian algorithm [Internet]. Optimization Methods and Software. 2020 ; 35( 5): 885-920.Available from: http://dx.doi.org/10.1080/10556788.2020.1746962
    • Vancouver

      Birgin EJG, Martínez JM. Complexity and performance of an Augmented Lagrangian algorithm [Internet]. Optimization Methods and Software. 2020 ; 35( 5): 885-920.Available from: http://dx.doi.org/10.1080/10556788.2020.1746962
  • Source: Mathematics of Computation. Unidade: IME

    Subjects: PROGRAMAÇÃO MATEMÁTICA, MÉTODOS NUMÉRICOS DE OTIMIZAÇÃO, PROGRAMAÇÃO NÃO LINEAR

    Versão AceitaOnline source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BIRGIN, Ernesto Julian Goldberg; KREJIĆ, Nataša; MARTÍNEZ, José Mário. Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact. Mathematics of Computation, Providence, v. 89, p. 253-278, 2020. Disponível em: < https://dx.doi.org/10.1090/mcom/3445 > DOI: 10.1090/mcom/3445.
    • APA

      Birgin, E. J. G., Krejić, N., & Martínez, J. M. (2020). Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact. Mathematics of Computation, 89, 253-278. doi:10.1090/mcom/3445
    • NLM

      Birgin EJG, Krejić N, Martínez JM. Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact [Internet]. Mathematics of Computation. 2020 ; 89 253-278.Available from: https://dx.doi.org/10.1090/mcom/3445
    • Vancouver

      Birgin EJG, Krejić N, Martínez JM. Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact [Internet]. Mathematics of Computation. 2020 ; 89 253-278.Available from: https://dx.doi.org/10.1090/mcom/3445
  • Source: Computers & Operations Research. Unidades: IME, EP

    Subjects: ALGORITMOS DE SCHEDULING, HEURÍSTICA

    PrivateOnline source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      LUNARDI, Willian Tessaro; BIRGIN, Ernesto Julian Goldberg; LABORIE, Philippe; RONCONI, Débora Pretti; VOOS, Holger. Mixed Integer linear programming and constraint programming models for the online printing shop scheduling problem. Computers & Operations Research, Oxford, v. 123, p. 1-20, 2020. Disponível em: < https://doi.org/10.1016/j.cor.2020.105020 > DOI: 10.1016/j.cor.2020.105020.
    • APA

      Lunardi, W. T., Birgin, E. J. G., Laborie, P., Ronconi, D. P., & Voos, H. (2020). Mixed Integer linear programming and constraint programming models for the online printing shop scheduling problem. Computers & Operations Research, 123, 1-20. doi:10.1016/j.cor.2020.105020
    • NLM

      Lunardi WT, Birgin EJG, Laborie P, Ronconi DP, Voos H. Mixed Integer linear programming and constraint programming models for the online printing shop scheduling problem [Internet]. Computers & Operations Research. 2020 ; 123 1-20.Available from: https://doi.org/10.1016/j.cor.2020.105020
    • Vancouver

      Lunardi WT, Birgin EJG, Laborie P, Ronconi DP, Voos H. Mixed Integer linear programming and constraint programming models for the online printing shop scheduling problem [Internet]. Computers & Operations Research. 2020 ; 123 1-20.Available from: https://doi.org/10.1016/j.cor.2020.105020
  • Source: Conference book. Conference title: International Conference on Continuous Optimization - ICCOPT. Unidade: IME

    Subjects: OTIMIZAÇÃO MATEMÁTICA, PROGRAMAÇÃO MATEMÁTICA

    Versão PublicadaOnline source accessHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BIRGIN, Ernesto Julian Goldberg; MARTÍNEZ, José Mário. A Newton-like method with mixed factorizations and cubic regularization and its usage in an Augmented Lagrangian framework. Anais.. Berlin: Weierstrass Institute for Applied Analysis and Stochastics (WIAS), 2019.Disponível em: .
    • APA

      Birgin, E. J. G., & Martínez, J. M. (2019). A Newton-like method with mixed factorizations and cubic regularization and its usage in an Augmented Lagrangian framework. In Conference book. Berlin: Weierstrass Institute for Applied Analysis and Stochastics (WIAS). Recuperado de https://www.iccopt2019.berlin/downloads/ICCOPT2019_Conference_Book.pdf
    • NLM

      Birgin EJG, Martínez JM. A Newton-like method with mixed factorizations and cubic regularization and its usage in an Augmented Lagrangian framework [Internet]. Conference book. 2019 ;Available from: https://www.iccopt2019.berlin/downloads/ICCOPT2019_Conference_Book.pdf
    • Vancouver

      Birgin EJG, Martínez JM. A Newton-like method with mixed factorizations and cubic regularization and its usage in an Augmented Lagrangian framework [Internet]. Conference book. 2019 ;Available from: https://www.iccopt2019.berlin/downloads/ICCOPT2019_Conference_Book.pdf
  • Source: Computational Optimization and Applications. Unidade: IME

    Subjects: OTIMIZAÇÃO MATEMÁTICA, PROGRAMAÇÃO MATEMÁTICA

    PrivateOnline source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BIRGIN, Ernesto Julian Goldberg; MARTINEZ, José Mario. A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization. Computational Optimization and Applications, New York, v. 73, n. 3, p. 707-753, 2019. Disponível em: < https://doi.org/10.1007/s10589-019-00089-7 > DOI: 10.1007/s10589-019-00089-7.
    • APA

      Birgin, E. J. G., & Martinez, J. M. (2019). A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization. Computational Optimization and Applications, 73( 3), 707-753. doi:10.1007/s10589-019-00089-7
    • NLM

      Birgin EJG, Martinez JM. A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization [Internet]. Computational Optimization and Applications. 2019 ; 73( 3): 707-753.Available from: https://doi.org/10.1007/s10589-019-00089-7
    • Vancouver

      Birgin EJG, Martinez JM. A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization [Internet]. Computational Optimization and Applications. 2019 ; 73( 3): 707-753.Available from: https://doi.org/10.1007/s10589-019-00089-7
  • Source: European Journal of Operational Research. Unidade: IME

    Subjects: PROGRAMAÇÃO NÃO LINEAR, ALGORITMOS PARA PROCESSAMENTO

    PrivateOnline source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BIRGIN, Ernesto Julian Goldberg; LOBATO, Rafael Durbano. A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids. European Journal of Operational Research, Amsterdam, v. 272, n. 2, p. 447-464, 2019. Disponível em: < https://doi.org/10.1016/j.ejor.2018.07.006 > DOI: 10.1016/j.ejor.2018.07.006.
    • APA

      Birgin, E. J. G., & Lobato, R. D. (2019). A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids. European Journal of Operational Research, 272( 2), 447-464. doi:10.1016/j.ejor.2018.07.006
    • NLM

      Birgin EJG, Lobato RD. A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids [Internet]. European Journal of Operational Research. 2019 ; 272( 2): 447-464.Available from: https://doi.org/10.1016/j.ejor.2018.07.006
    • Vancouver

      Birgin EJG, Lobato RD. A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids [Internet]. European Journal of Operational Research. 2019 ; 272( 2): 447-464.Available from: https://doi.org/10.1016/j.ejor.2018.07.006

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