Menu

Filtros : "Financiamento AFOSR" "ICMC-SME" Limpar

Filtros

Refine with date range

  • 1

1 - 4 (4 records)

  • Artigo de periodico

    Lagrangian-based heuristics for production planning with perishable products, scarce resources, and sequence-dependent setup times (2025)

    Soler, Willy Alves de Oliveira ; Santos, Maristela Oliveira dos ; Akartunalı, Kerem

    Source: Journal of Heuristics. Unidade: ICMC

    Subjects: HEURÍSTICA, PLANEJAMENTO DA PRODUÇÃO

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

    • ABNT

      SOLER, Willy Alves de Oliveira e SANTOS, Maristela Oliveira dos e AKARTUNALI, Kerem. Lagrangian-based heuristics for production planning with perishable products, scarce resources, and sequence-dependent setup times. Journal of Heuristics, v. 31, p. 1-35, 2025Tradução . . Disponível em: https://doi.org/10.1007/s10732-024-09539-w. Acesso em: 15 nov. 2025.

    • APA

      Soler, W. A. de O., Santos, M. O. dos, & Akartunalı, K. (2025). Lagrangian-based heuristics for production planning with perishable products, scarce resources, and sequence-dependent setup times. Journal of Heuristics, 31, 1-35. doi:10.1007/s10732-024-09539-w

    • NLM

      Soler WA de O, Santos MO dos, Akartunalı K. Lagrangian-based heuristics for production planning with perishable products, scarce resources, and sequence-dependent setup times [Internet]. Journal of Heuristics. 2025 ; 31 1-35.[citado 2025 nov. 15 ] Available from: https://doi.org/10.1007/s10732-024-09539-w

    • Vancouver

      Soler WA de O, Santos MO dos, Akartunalı K. Lagrangian-based heuristics for production planning with perishable products, scarce resources, and sequence-dependent setup times [Internet]. Journal of Heuristics. 2025 ; 31 1-35.[citado 2025 nov. 15 ] Available from: https://doi.org/10.1007/s10732-024-09539-w

  • Artigo de periodico

    A fast high-dimensional continuation hypercubes algorithm (2025)

    Reia, Lucas Martinelli ; Gameiro, Márcio Fuzeto ; Ribeiro, Tomás Bueno Moraes; Castelo, Antonio

    Source: Computers and Graphics. Unidade: ICMC

    Subjects: APROXIMAÇÃO LINEAR, MÉTODOS DE CONTINUAÇÃO, ALGORITMOS

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

    • ABNT

      REIA, Lucas Martinelli et al. A fast high-dimensional continuation hypercubes algorithm. Computers and Graphics, v. 129, p. 1-22, 2025Tradução . . Disponível em: https://doi.org/10.1016/j.cag.2025.104237. Acesso em: 15 nov. 2025.

    • APA

      Reia, L. M., Gameiro, M. F., Ribeiro, T. B. M., & Castelo, A. (2025). A fast high-dimensional continuation hypercubes algorithm. Computers and Graphics, 129, 1-22. doi:10.1016/j.cag.2025.104237

    • NLM

      Reia LM, Gameiro MF, Ribeiro TBM, Castelo A. A fast high-dimensional continuation hypercubes algorithm [Internet]. Computers and Graphics. 2025 ; 129 1-22.[citado 2025 nov. 15 ] Available from: https://doi.org/10.1016/j.cag.2025.104237

    • Vancouver

      Reia LM, Gameiro MF, Ribeiro TBM, Castelo A. A fast high-dimensional continuation hypercubes algorithm [Internet]. Computers and Graphics. 2025 ; 129 1-22.[citado 2025 nov. 15 ] Available from: https://doi.org/10.1016/j.cag.2025.104237

  • Artigo de periodico

    A generalized combinatorial marching hypercube algorithm (2024)

    Castelo, Antonio ; Nakassima, Guilherme Kenji ; Bueno, Lucas Moutinho; Gameiro, Márcio Fuzeto

    Source: Computational and Applied Mathematics. Unidade: ICMC

    Subjects: ALGORITMOS, TOPOLOGIA COMBINATÓRIA, ANÁLISE DE DESEMPENHO

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

    • ABNT

      CASTELO, Antonio et al. A generalized combinatorial marching hypercube algorithm. Computational and Applied Mathematics, v. 43, p. 1-23, 2024Tradução . . Disponível em: https://doi.org/10.1007/s40314-024-02627-4. Acesso em: 15 nov. 2025.

    • APA

      Castelo, A., Nakassima, G. K., Bueno, L. M., & Gameiro, M. F. (2024). A generalized combinatorial marching hypercube algorithm. Computational and Applied Mathematics, 43, 1-23. doi:10.1007/s40314-024-02627-4

    • NLM

      Castelo A, Nakassima GK, Bueno LM, Gameiro MF. A generalized combinatorial marching hypercube algorithm [Internet]. Computational and Applied Mathematics. 2024 ; 43 1-23.[citado 2025 nov. 15 ] Available from: https://doi.org/10.1007/s40314-024-02627-4

    • Vancouver

      Castelo A, Nakassima GK, Bueno LM, Gameiro MF. A generalized combinatorial marching hypercube algorithm [Internet]. Computational and Applied Mathematics. 2024 ; 43 1-23.[citado 2025 nov. 15 ] Available from: https://doi.org/10.1007/s40314-024-02627-4

  • Artigo de periodico-carta/editorial

    Complex systems in the spotlight: next steps after the 2021 Nobel Prize in Physics [Editorial] (2023)

    Bianconi, Ginestra ; Arenas, Alex ; Biamonte, Jacob ; Carr, Lincoln D ; Kahng, Byungnam ; Kertesz, Janos ; Kurths, Jürgen ; Lü, Linyuan ; Masoller, Cristina ; Motter, Adilson E ; Perc, Matjaz ; Radicchi, Filippo ; Ramaswamy, Ramakrishna ; Rodrigues, Francisco Aparecido ; Sales-Pardo, Marta ; Miguel, Maxi San ; Thurner, Stefan ; Yasseri, Taha

    Source: Journal of Physics : Complexity. Unidade: ICMC

    Subjects: FUTURO, COMPLEXIDADE, CIÊNCIAS EXATAS

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

    • ABNT

      BIANCONI, Ginestra et al. Complex systems in the spotlight: next steps after the 2021 Nobel Prize in Physics [Editorial]. Journal of Physics : Complexity. Bristol: Instituto de Ciências Matemáticas e de Computação, Universidade de São Paulo. Disponível em: https://doi.org/10.1088/2632-072X/ac7f75. Acesso em: 15 nov. 2025. , 2023

    • APA

      Bianconi, G., Arenas, A., Biamonte, J., Carr, L. D., Kahng, B., Kertesz, J., et al. (2023). Complex systems in the spotlight: next steps after the 2021 Nobel Prize in Physics [Editorial]. Journal of Physics : Complexity. Bristol: Instituto de Ciências Matemáticas e de Computação, Universidade de São Paulo. doi:10.1088/2632-072X/ac7f75

    • NLM

      Bianconi G, Arenas A, Biamonte J, Carr LD, Kahng B, Kertesz J, Kurths J, Lü L, Masoller C, Motter AE, Perc M, Radicchi F, Ramaswamy R, Rodrigues FA, Sales-Pardo M, Miguel MS, Thurner S, Yasseri T. Complex systems in the spotlight: next steps after the 2021 Nobel Prize in Physics [Editorial] [Internet]. Journal of Physics : Complexity. 2023 ; 4 1-28.[citado 2025 nov. 15 ] Available from: https://doi.org/10.1088/2632-072X/ac7f75

    • Vancouver

      Bianconi G, Arenas A, Biamonte J, Carr LD, Kahng B, Kertesz J, Kurths J, Lü L, Masoller C, Motter AE, Perc M, Radicchi F, Ramaswamy R, Rodrigues FA, Sales-Pardo M, Miguel MS, Thurner S, Yasseri T. Complex systems in the spotlight: next steps after the 2021 Nobel Prize in Physics [Editorial] [Internet]. Journal of Physics : Complexity. 2023 ; 4 1-28.[citado 2025 nov. 15 ] Available from: https://doi.org/10.1088/2632-072X/ac7f75
  • 1

1 - 4 (4 records)

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