This week's book giveaway is in the Mac OS forum. We're giving away four copies of a choice of "Take Control of Upgrading to Yosemite" or "Take Control of Automating Your Mac" and have Joe Kissell on-line! See this thread for details.
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:
2 1 3 2
12 10 20 15
3 2 1 4 5
25 20 15 40 50
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.