Menu

Filtros : "PROGRAMAÇÃO ESTOCÁSTICA" "Indexado no Web of Science" Limpar

Filtros

Refine with date range

  • 1

1 - 2 (2 records)

  • Artigo de periodico

    A granular local search matheuristic for a heterogeneous fleet vehicle routing problem with stochastic travel times (2022)

    Fachini, Ramon Faganello ; Armentano, Vinícius Amaral ; Toledo, Franklina Maria Bragion de

    Source: Networks and Spatial Economics. Unidade: ICMC

    Subjects: PROGRAMAÇÃO ESTOCÁSTICA, DISTRIBUIÇÕES (PROBABILIDADE), BENCHMARKS

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

    • ABNT

      FACHINI, Ramon Faganello e ARMENTANO, Vinícius Amaral e TOLEDO, Franklina Maria Bragion de. A granular local search matheuristic for a heterogeneous fleet vehicle routing problem with stochastic travel times. Networks and Spatial Economics, v. 22, p. 33-64, 2022Tradução . . Disponível em: https://doi.org/10.1007/s11067-021-09553-6. Acesso em: 08 nov. 2025.

    • APA

      Fachini, R. F., Armentano, V. A., & Toledo, F. M. B. de. (2022). A granular local search matheuristic for a heterogeneous fleet vehicle routing problem with stochastic travel times. Networks and Spatial Economics, 22, 33-64. doi:10.1007/s11067-021-09553-6

    • NLM

      Fachini RF, Armentano VA, Toledo FMB de. A granular local search matheuristic for a heterogeneous fleet vehicle routing problem with stochastic travel times [Internet]. Networks and Spatial Economics. 2022 ; 22 33-64.[citado 2025 nov. 08 ] Available from: https://doi.org/10.1007/s11067-021-09553-6

    • Vancouver

      Fachini RF, Armentano VA, Toledo FMB de. A granular local search matheuristic for a heterogeneous fleet vehicle routing problem with stochastic travel times [Internet]. Networks and Spatial Economics. 2022 ; 22 33-64.[citado 2025 nov. 08 ] Available from: https://doi.org/10.1007/s11067-021-09553-6

  • Artigo de periodico

    A branch-and-cut algorithm for the irregular strip packing problem with uncertain demands (2022)

    Queiroz, Layane Rodrigues de Souza ; Andretta, Marina

    Source: International Transactions in Operational Research. Unidade: ICMC

    Subjects: PROGRAMAÇÃO ESTOCÁSTICA, HEURÍSTICA, ALGORITMOS

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

    • ABNT

      QUEIROZ, Layane Rodrigues de Souza e ANDRETTA, Marina. A branch-and-cut algorithm for the irregular strip packing problem with uncertain demands. International Transactions in Operational Research, v. 29, n. 6, p. 3486-3513, 2022Tradução . . Disponível em: https://doi.org/10.1111/itor.13122. Acesso em: 08 nov. 2025.

    • APA

      Queiroz, L. R. de S., & Andretta, M. (2022). A branch-and-cut algorithm for the irregular strip packing problem with uncertain demands. International Transactions in Operational Research, 29( 6), 3486-3513. doi:10.1111/itor.13122

    • NLM

      Queiroz LR de S, Andretta M. A branch-and-cut algorithm for the irregular strip packing problem with uncertain demands [Internet]. International Transactions in Operational Research. 2022 ; 29( 6): 3486-3513.[citado 2025 nov. 08 ] Available from: https://doi.org/10.1111/itor.13122

    • Vancouver

      Queiroz LR de S, Andretta M. A branch-and-cut algorithm for the irregular strip packing problem with uncertain demands [Internet]. International Transactions in Operational Research. 2022 ; 29( 6): 3486-3513.[citado 2025 nov. 08 ] Available from: https://doi.org/10.1111/itor.13122
  • 1

1 - 2 (2 records)

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