An efficient parallel algorithm for solving the Knapsack problem on hypercubes (2004)
Source: Journal of Parallel and Distributed Computing. Unidade: IME
Subjects: METODOLOGIA E TÉCNICAS DE COMPUTAÇÃO, TEORIA DOS GRAFOS, PROGRAMAÇÃO PARALELA, SCHEDULING
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GOLDMAN, Alfredo e TRYSTRAM, Denis. An efficient parallel algorithm for solving the Knapsack problem on hypercubes. Journal of Parallel and Distributed Computing, v. 64, n. 11, p. 1213-1222, 2004Tradução . . Disponível em: https://doi.org/10.1016/j.jpdc.2002.10.001. Acesso em: 12 abr. 2026.APA
Goldman, A., & Trystram, D. (2004). An efficient parallel algorithm for solving the Knapsack problem on hypercubes. Journal of Parallel and Distributed Computing, 64( 11), 1213-1222. doi:10.1016/j.jpdc.2002.10.001NLM
Goldman A, Trystram D. An efficient parallel algorithm for solving the Knapsack problem on hypercubes [Internet]. Journal of Parallel and Distributed Computing. 2004 ; 64( 11): 1213-1222.[citado 2026 abr. 12 ] Available from: https://doi.org/10.1016/j.jpdc.2002.10.001Vancouver
Goldman A, Trystram D. An efficient parallel algorithm for solving the Knapsack problem on hypercubes [Internet]. Journal of Parallel and Distributed Computing. 2004 ; 64( 11): 1213-1222.[citado 2026 abr. 12 ] Available from: https://doi.org/10.1016/j.jpdc.2002.10.001
