International Journal of Multidisciplinary Research and Development

International Journal of Multidisciplinary Research and Development


International Journal of Multidisciplinary Research and Development
International Journal of Multidisciplinary Research and Development
Vol. 7, Issue 8 (2020)

The comparison between the dynamic programming method and integer programming method for knapsack problem


Xintong Yang

The knapsack problem is an important problem in operations research. By taking some practical instances with the use of the dynamic programming method and integer programming method to solve the knapsack problem, this paper makes a comprehensive comparison of the two methods, and the conclusion is: When the integer programming method is applied to solve the knapsack problem, it is necessary to decide to use implicit enumeration method or branch and bound method according to the type of the knapsack problem. While the dynamic programming method pays more attention to the middle process of putting items.
Download  |  Pages : 147-151
How to cite this article:
Xintong Yang. The comparison between the dynamic programming method and integer programming method for knapsack problem. International Journal of Multidisciplinary Research and Development, Volume 7, Issue 8, 2020, Pages 147-151
International Journal of Multidisciplinary Research and Development International Journal of Multidisciplinary Research and Development