This week's book giveaway is in the Clojure forum.
We're giving away four copies of Clojure in Action and have Amit Rathore and Francis Avila on-line!
See this thread for details.
Win a copy of Clojure in Action this week in the Clojure forum!
  • Post Reply
  • Bookmark Topic Watch Topic
  • New Topic

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

 
Mitul Patell
Greenhorn
Posts: 17
  • 0
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
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.
 
It is sorta covered in the JavaRanch Style Guide.
  • Post Reply
  • Bookmark Topic Watch Topic
  • New Topic