A Dynamic Programming based GA for 0-1 Modified Knapsack Problem

  • Zaheed Ahmed PMAS-AAUR, Taxila Cantt
  • Published 2011
The classical 0-1 knapsack problem is one of the more studied combinatorial optimization problem which belong to the NP class of algorithms. A number of its generalized forms have been addressed by various researchers using different designing techniques. In this paper, we design and analyze the Multiple Knapsack Problems (MKP) by using genetic algorithms… CONTINUE READING