Zavala-Díaz, J.C.; Cruz-Chávez, M.A.; López-Calderón, J.; Hernández-Aguilar, J.A.; Luna-Ortíz, M.E.
A Multi-Branch-and-Bound Binary Parallel Algorithm to Solve the Knapsack Problem 0–1 in a Multicore Cluster. Appl. Sci. 2019, 9, 5368.
https://doi.org/10.3390/app9245368
AMA Style
Zavala-Díaz JC, Cruz-Chávez MA, López-Calderón J, Hernández-Aguilar JA, Luna-Ortíz ME.
A Multi-Branch-and-Bound Binary Parallel Algorithm to Solve the Knapsack Problem 0–1 in a Multicore Cluster. Applied Sciences. 2019; 9(24):5368.
https://doi.org/10.3390/app9245368
Chicago/Turabian Style
Zavala-Díaz, José Crispín, Marco Antonio Cruz-Chávez, Jacqueline López-Calderón, José Alberto Hernández-Aguilar, and Martha Elena Luna-Ortíz.
2019. "A Multi-Branch-and-Bound Binary Parallel Algorithm to Solve the Knapsack Problem 0–1 in a Multicore Cluster" Applied Sciences 9, no. 24: 5368.
https://doi.org/10.3390/app9245368
APA Style
Zavala-Díaz, J. C., Cruz-Chávez, M. A., López-Calderón, J., Hernández-Aguilar, J. A., & Luna-Ortíz, M. E.
(2019). A Multi-Branch-and-Bound Binary Parallel Algorithm to Solve the Knapsack Problem 0–1 in a Multicore Cluster. Applied Sciences, 9(24), 5368.
https://doi.org/10.3390/app9245368