title: Which is the best method between Genetic Algorithm and Dynamic Programming to solve classic 0-1 knapsack?
body: <p>Let's say I have problem like this:</p>
  
  <ul>
  <li>Knapsack capacity = 20 million</li>
  <li>Number of item = 500</li>
  <li>Weight of each item is random number between 100 to 20 million</li>
  <li>Profit of each item is random number between 1 to 10</li>
  </ul>
  
  <p>So which is the best method for my problem? GA or Dynamic Programming?</p>
  
  <p>Please give me a simple explanation, as I'm newbie in this..</p>