An improved parallel algorithm for 0/1 knapsack problem.
Journal
Parallel Computing
Journal Volume
18
Journal Issue
7
Pages
811-821
Date Issued
1992
Author(s)
Abstract
A parallel algorithm based on a technique called delayed dominance is proposed for solving the 0/1 knapsack problem. This parallel algorithm is a modification of Chen, Chern and Jang's algorithm. Experiments show that the new algorithm has a better performance than Chen et al.'s algorithm. © 1992.
Type
journal article