By Topic

A new parallel algorithm for the knapsack problem and its implementation on a hypercube

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
J. Lin ; Dept. of Comput. Sci., Brandeis Univ., Waltham, MA, USA ; J. A. Storer

A new parallel algorithm is presented for the 0/1 knapsack problem. On a hypercube of n processors, the algorithm runs in time O(mc(log n)/n), where m is the number of objects and c is the knapsack size. The best previous known hypercube algorithm takes time O(mc /n+c log n+c2). The new algorithm has been implemented on the Connection Machine and experimental results show that it performs very well for a wide range of problem sizes

Published in:

Frontiers of Massively Parallel Computation, 1990. Proceedings., 3rd Symposium on the

Date of Conference:

8-10 Oct 1990