A Pipelined Algorithm for Multiple-Choice 0/1 Knapsack Problem.
Journal
International Journal of High Speed Computing
Journal Volume
4
Journal Issue
1
Pages
43-48
Date Issued
1992
Author(s)
Abstract
In this paper, we first propose a dynamic programming solution to the multiple-choice 0/1 knapsack problem. Then, a pipelined algorithm based on the dynamic programming solution is derived. The pipelined architecture consists of a linear processor array, a queue, and a memory module, which are connected into a cycle. The processor array is of fixed length and can be regarded as a pipeline where the dynamic programming algorithm is implemented through pipelining.
SDGs
Type
journal article