Abstract: In combinatorial optimization problems (COPs), a solution is an arrangement of the elements (solution components) following a specific representation (e.g., array, tree, and graph).

Abstract: This paper aims at comparing the serial, shared memory parallelization, and distributed memory parallelization of the dynamic programming algorithm for the Knapsack Problem. Knapsack Problem ...