Menu

Filtros : "Indexado no CompuMath Citation Index" "Costa, Alysson Machado" Removido: "Communications on Pure and Applied Analysis" Limpar

Filtros

Refine with date range

  • 1

1 - 2 (2 records)

  • Artigo de periodico

    An integer linear programming approach for approximate string comparison (2009)

    Ritt, Marcus; Costa, Alysson Machado; Mergenhagen, Stephan E.; Mergen, Sergio; Orengo, Viviane M.

    Source: European Journal of Operational Research. Unidade: ICMC

    Subjects: OTIMIZAÇÃO COMBINATÓRIA, PESQUISA OPERACIONAL

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

    • ABNT

      RITT, Marcus et al. An integer linear programming approach for approximate string comparison. European Journal of Operational Research, v. 198, n. 3, p. 706-714, 2009Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2008.10.013. Acesso em: 27 nov. 2025.

    • APA

      Ritt, M., Costa, A. M., Mergenhagen, S. E., Mergen, S., & Orengo, V. M. (2009). An integer linear programming approach for approximate string comparison. European Journal of Operational Research, 198( 3), 706-714. doi:10.1016/j.ejor.2008.10.013

    • NLM

      Ritt M, Costa AM, Mergenhagen SE, Mergen S, Orengo VM. An integer linear programming approach for approximate string comparison [Internet]. European Journal of Operational Research. 2009 ; 198( 3): 706-714.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1016/j.ejor.2008.10.013

    • Vancouver

      Ritt M, Costa AM, Mergenhagen SE, Mergen S, Orengo VM. An integer linear programming approach for approximate string comparison [Internet]. European Journal of Operational Research. 2009 ; 198( 3): 706-714.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1016/j.ejor.2008.10.013

  • Artigo de periodico

    Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints (2008)

    Costa, Alysson Machado; Cordeau, Jean-François; Laporte, Gilbert

    Source: European Journal of Operational Research. Unidade: ICMC

    Subjects: HEURÍSTICA, REDES DE COMPUTADORES

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

    • ABNT

      COSTA, Alysson Machado e CORDEAU, Jean-François e LAPORTE, Gilbert. Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints. European Journal of Operational Research, v. 190, n. 1, p. 68-78, 2008Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2007.06.012. Acesso em: 27 nov. 2025.

    • APA

      Costa, A. M., Cordeau, J. -F., & Laporte, G. (2008). Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints. European Journal of Operational Research, 190( 1), 68-78. doi:10.1016/j.ejor.2007.06.012

    • NLM

      Costa AM, Cordeau J-F, Laporte G. Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints [Internet]. European Journal of Operational Research. 2008 ; 190( 1): 68-78.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1016/j.ejor.2007.06.012

    • Vancouver

      Costa AM, Cordeau J-F, Laporte G. Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints [Internet]. European Journal of Operational Research. 2008 ; 190( 1): 68-78.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1016/j.ejor.2007.06.012
  • 1

1 - 2 (2 records)

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