An efficient dynamic programming parallel algorithm for the 0-1 knapsack problem
Abstract
An efficient parallel algorithm for the 0-1 knapsack problem is presented. The algorithm is based on dynamic progamming in conjunction with dominance state techniques. An original load balancing strategy wich is designed in order to achieve good efficiency of the parallel algorithm is proposed. Finally computational results obtained with an Origin 2000 supercomputer are displaed and anlyzed.
Fichier principal
ws-p8-50x6-00 (1).pdf (123.07 Ko)
Télécharger le fichier
ws-p8-50x6-00.pdf (123.07 Ko)
Télécharger le fichier

Origin : Files produced by the author(s)
Origin : Files produced by the author(s)