Menu

Filtros : "Wolsey, Laurence A" Limpar

Filtros

Refine with date range

  • 1

1 - 2 (2 records)

  • 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: 12 jun. 2024.

    • 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 2024 jun. 12 ] 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 2024 jun. 12 ] Available from: https://doi.org/10.1007/bf01581107

  • Artigo de periodico

    Formulations and valid inequalities for the node capacitated graph partitioning problem (1996)

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

    Source: Mathematical Programming. Unidade: IME

    Subjects: PESQUISA OPERACIONAL, PROGRAMAÇÃO MATEMÁTICA, COMBINATÓRIA, TEORIA DOS GRAFOS

    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. Formulations and valid inequalities for the node capacitated graph partitioning problem. Mathematical Programming, v. 74, n. 3, p. 247-266, 1996Tradução . . Disponível em: https://doi.org/10.1007/bf02592198. Acesso em: 12 jun. 2024.

    • APA

      Ferreira, C. E., Martin, A., Souza, C. C. de, Weismantel, R., & Wolsey, L. A. (1996). Formulations and valid inequalities for the node capacitated graph partitioning problem. Mathematical Programming, 74( 3), 247-266. doi:10.1007/bf02592198

    • NLM

      Ferreira CE, Martin A, Souza CC de, Weismantel R, Wolsey LA. Formulations and valid inequalities for the node capacitated graph partitioning problem [Internet]. Mathematical Programming. 1996 ; 74( 3): 247-266.[citado 2024 jun. 12 ] Available from: https://doi.org/10.1007/bf02592198

    • Vancouver

      Ferreira CE, Martin A, Souza CC de, Weismantel R, Wolsey LA. Formulations and valid inequalities for the node capacitated graph partitioning problem [Internet]. Mathematical Programming. 1996 ; 74( 3): 247-266.[citado 2024 jun. 12 ] Available from: https://doi.org/10.1007/bf02592198
  • 1

1 - 2 (2 records)

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