The paper is devoted to a comparative study of different versions of the dynamic programming method for the knapsack problem. The formulation of the problem and various versions of dynamic programming ...

Abstract: Concepts such as equivalent value transformation, reverse value transformation and transform sequence were defined according to characteristics of 0-1 knapsack problem, then a special ...