Newsgroups: comp.parallel.mpi
From: Roman Batoukov <roman@ii.uib.no>
Subject: 0/1 knapsack problem
Organization: University of Bergen
Date: Mon, 24 Nov 1997 19:10:05 +0100
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Message-ID: <3479C2FD.41C6@ii.uib.no>

Hello!
I use MPI, developing the software for the solution of optimization
problems by means of parallel branch-and-bound method.
I'll greatly appreciate if anybody could send me a sample of 0/1
knapsack problem for more than 30 items with the correct result. I need
it for the purposes of test and profiling.
Thanks in advance for any assistance.