Filtros : "Financiamento PRONEX" "Chile" Limpar

Filtros



Refine with date range


  • Source: Mathematical Programming. Unidade: IME

    Subjects: PROGRAMAÇÃO NÃO LINEAR, OTIMIZAÇÃO NÃO LINEAR, PESQUISA OPERACIONAL

    Disponível em 2026-06-17Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      ANDREANI, Roberto et al. A minimal face constant rank constraint qualification for reducible conic programming. Mathematical Programming, p. 1-27, 2025Tradução . . Disponível em: https://doi.org/10.1007/s10107-025-02237-w. Acesso em: 09 nov. 2025.
    • APA

      Andreani, R., Haeser, G., Mito, L., & Ramírez, H. (2025). A minimal face constant rank constraint qualification for reducible conic programming. Mathematical Programming, 1-27. doi:10.1007/s10107-025-02237-w
    • NLM

      Andreani R, Haeser G, Mito L, Ramírez H. A minimal face constant rank constraint qualification for reducible conic programming [Internet]. Mathematical Programming. 2025 ; 1-27.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1007/s10107-025-02237-w
    • Vancouver

      Andreani R, Haeser G, Mito L, Ramírez H. A minimal face constant rank constraint qualification for reducible conic programming [Internet]. Mathematical Programming. 2025 ; 1-27.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1007/s10107-025-02237-w
  • Source: Chemistry Select. Unidade: IFSC

    Subjects: CRISTALOGRAFIA, CITOTOXINAS

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

      CAIRO, Raúl Ramos et al. Dynamics of formation of binuclear metal complexes: a new Cu(I) compound with N-(2-thiophenecarbonyl)-N’-(3-Cl, 4-F-phenyl)thiourea as ligand. Chemistry Select, v. 7, n. 29, p. e202202145-1-e202202145-8, 2022Tradução . . Disponível em: https://doi.org/10.1002/slct.202202145. Acesso em: 09 nov. 2025.
    • APA

      Cairo, R. R., Plutín, A. M., Castell, R. O. M., Castellano, E. E., Correa, R. S., González, D. L. N., et al. (2022). Dynamics of formation of binuclear metal complexes: a new Cu(I) compound with N-(2-thiophenecarbonyl)-N’-(3-Cl, 4-F-phenyl)thiourea as ligand. Chemistry Select, 7( 29), e202202145-1-e202202145-8. doi:10.1002/slct.202202145
    • NLM

      Cairo RR, Plutín AM, Castell ROM, Castellano EE, Correa RS, González DLN, Erben MF, Cominetti MR, Leite CM, Oliveira TD, Batista AA. Dynamics of formation of binuclear metal complexes: a new Cu(I) compound with N-(2-thiophenecarbonyl)-N’-(3-Cl, 4-F-phenyl)thiourea as ligand [Internet]. Chemistry Select. 2022 ; 7( 29): e202202145-1-e202202145-8.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1002/slct.202202145
    • Vancouver

      Cairo RR, Plutín AM, Castell ROM, Castellano EE, Correa RS, González DLN, Erben MF, Cominetti MR, Leite CM, Oliveira TD, Batista AA. Dynamics of formation of binuclear metal complexes: a new Cu(I) compound with N-(2-thiophenecarbonyl)-N’-(3-Cl, 4-F-phenyl)thiourea as ligand [Internet]. Chemistry Select. 2022 ; 7( 29): e202202145-1-e202202145-8.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1002/slct.202202145
  • Source: Mathematical Programming. Unidade: IME

    Assunto: OTIMIZAÇÃO COMBINATÓRIA

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

      CORREA, J. R. e FERNANDES, Cristina Gomes e WAKABAYASHI, Yoshiko. Approximating a class of combinatorial problems with rational objective function. Mathematical Programming, v. 124, n. 1-2, p. 255-269, 2010Tradução . . Disponível em: https://doi.org/10.1007/s10107-010-0364-8. Acesso em: 09 nov. 2025.
    • APA

      Correa, J. R., Fernandes, C. G., & Wakabayashi, Y. (2010). Approximating a class of combinatorial problems with rational objective function. Mathematical Programming, 124( 1-2), 255-269. doi:10.1007/s10107-010-0364-8
    • NLM

      Correa JR, Fernandes CG, Wakabayashi Y. Approximating a class of combinatorial problems with rational objective function [Internet]. Mathematical Programming. 2010 ; 124( 1-2): 255-269.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1007/s10107-010-0364-8
    • Vancouver

      Correa JR, Fernandes CG, Wakabayashi Y. Approximating a class of combinatorial problems with rational objective function [Internet]. Mathematical Programming. 2010 ; 124( 1-2): 255-269.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1007/s10107-010-0364-8

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