Abstract
This paper describes and compares two parallel implementations of the 0-1 Knapsack Problem. We have used the C++ programming language to develop two exact algorithms based on the Branch-and-Bound technique and implemented them in supercomputers and in a PC cluster. MPI has been used in the implementation of the Message Passing code and OpenMP was chosen for the Shared Memory code. Computational results on a Sunfire 6800 SMP, an Origin 3000 and a PC cluster are presented.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
