A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Communications on Applied Electronics
0--1 knapsack problem is a typical NP complete problem in field of computer. Traditional knapsack problem is solved recursively using backtracking, branch and bound, dynamic programming and greedy methods. The advantages of using recursive backtracking to solve knapsack problem algorithm areits simplicity, completely traverse the search space and sure to find the optimal solution. But the solution space is exponential growth, when extended to certain extent. This algorithm will solve thedoi:10.5120/cae2017652675 fatcat:hf5hkaetfreljfjmymb3u56ss4