title: 0-1 Knapsack algorithm
body: <p>Is the following 0-1 Knapsack problem solvable:</p>
  
  <ul>
  <li>'float' positive values and </li>
  <li>'float' weights (can be positive or negative)</li>
  <li>'float' capacity of the knapsack > 0</li>
  </ul>
  
  <p>I have on average &lt; 10 items, so I'm thinking of using a brute force implementation. However, I was wondering if there is a better way of doing it. </p>