The node capacitated graph pertitioning problem: a computational study (1998)
Source: Mathematical Programming. Unidade: IME
Assunto: COMBINATÓRIA
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: 02 out. 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/bf01581107NLM
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 out. 02 ] Available from: https://doi.org/10.1007/bf01581107Vancouver
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 out. 02 ] Available from: https://doi.org/10.1007/bf01581107