Menu

Filtros : "Mathematical Programming" "Bélgica" Removido: "PROGRAMAÇÃO MATEMÁTICA" Limpar

Filtros

Refine with date range

  • 1

1 - 2 (2 records)

  • Artigo de periodico

    Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models (2017)

    Birgin, Ernesto Julian Goldberg ; Gardenghi, J. L.; Martínez, J. M.; Santos, S. A.; Toint, Ph. L.

    Source: Mathematical Programming. Unidade: IME

    Subjects: OTIMIZAÇÃO NÃO LINEAR, OTIMIZAÇÃO IRRESTRITA

    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 et al. Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. Mathematical Programming, v. 163, n. 1-2, p. 359-368, 2017Tradução . . Disponível em: https://doi.org/10.1007/s10107-016-1065-8. Acesso em: 06 dez. 2025.

    • APA

      Birgin, E. J. G., Gardenghi, J. L., Martínez, J. M., Santos, S. A., & Toint, P. L. (2017). Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. Mathematical Programming, 163( 1-2), 359-368. doi:10.1007/s10107-016-1065-8

    • NLM

      Birgin EJG, Gardenghi JL, Martínez JM, Santos SA, Toint PL. Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models [Internet]. Mathematical Programming. 2017 ; 163( 1-2): 359-368.[citado 2025 dez. 06 ] Available from: https://doi.org/10.1007/s10107-016-1065-8

    • Vancouver

      Birgin EJG, Gardenghi JL, Martínez JM, Santos SA, Toint PL. Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models [Internet]. Mathematical Programming. 2017 ; 163( 1-2): 359-368.[citado 2025 dez. 06 ] Available from: https://doi.org/10.1007/s10107-016-1065-8

  • Artigo de periodico

    The node capacitated graph pertitioning problem: a computational study (1998)

    Ferreira, Carlos Eduardo ; Martin, A; Souza, C. C; Weismantel, R; Wolsey, Laurence A

    Source: Mathematical Programming. Unidade: IME

    Assunto: COMBINATÓRIA

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

    • ABNT

      FERREIRA, Carlos Eduardo et al. The node capacitated graph pertitioning problem: a computational study. Mathematical Programming, v. 81, p. 229-256, 1998Tradução . . Disponível em: https://doi.org/10.1007/bf01581107. Acesso em: 06 dez. 2025.

    • APA

      Ferreira, C. E., Martin, A., Souza, C. C., Weismantel, R., & Wolsey, L. A. (1998). The node capacitated graph pertitioning problem: a computational study. Mathematical Programming, 81, 229-256. doi:10.1007/bf01581107

    • NLM

      Ferreira CE, Martin A, Souza CC, Weismantel R, Wolsey LA. The node capacitated graph pertitioning problem: a computational study [Internet]. Mathematical Programming. 1998 ; 81 229-256.[citado 2025 dez. 06 ] Available from: https://doi.org/10.1007/bf01581107

    • Vancouver

      Ferreira CE, Martin A, Souza CC, Weismantel R, Wolsey LA. The node capacitated graph pertitioning problem: a computational study [Internet]. Mathematical Programming. 1998 ; 81 229-256.[citado 2025 dez. 06 ] Available from: https://doi.org/10.1007/bf01581107
  • 1

1 - 2 (2 records)

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