File APIs for Java Developers
Manipulate DOC, XLS, PPT, PDF and many others from your application.
http://aspose.com/file-tools
The moose likes C / C++ and the fly likes Exhaustive Search/Brute Force Algorithm for 0-1 Knapsack Problem Big Moose Saloon
  Search | Java FAQ | Recent Topics | Flagged Topics | Hot Topics | Zero Replies
Register / Login


Win a copy of Android Security Essentials Live Lessons this week in the Android forum!
JavaRanch » Java Forums » Languages » C / C++
Bookmark "Exhaustive Search/Brute Force Algorithm for 0-1 Knapsack Problem" Watch "Exhaustive Search/Brute Force Algorithm for 0-1 Knapsack Problem" New topic
Author

Exhaustive Search/Brute Force Algorithm for 0-1 Knapsack Problem

Mitul Patell
Greenhorn

Joined: Dec 17, 2012
Posts: 17
Hello all,

I've been tasked with creating a brute force program to solve the 0-1 knapsack problem. I have already set up my program to read data from the input file and to output and store that into variables for the weight, value, knapsack limit, and number of items. I am running into an issue with figuring out how to obtain all subsets of the given set and analyzing it. The following is the input data and my current code:

3

4
5
2 1 3 2
12 10 20 15

5
6
3 2 1 4 5
25 20 15 40 50

6
10
3 2 1 5 5 6
10 10 12 10 12 12




As you can see my solveInstance function is empty. The solveInstance function is meant to discover the amount of feasible subsets, the optimal value and subset, and how many optimal subsets there are.

Any tips to point me in the right direction would be much appreciated.
 
Consider Paul's rocket mass heater.
 
subject: Exhaustive Search/Brute Force Algorithm for 0-1 Knapsack Problem
 
Similar Threads
c++ code not compiling in online compiler?
this program can read your mind..please rate my program dear guys.
Conversion help plz!!!
knapsack, towers of hanoi, v. stuck!
knapsack problem - solution set