Algorithms.
permutations of the problem in worst case. So, by using Branch and Bound it can be solved quickly. Other Methods to solve Knapsack problem: Greedy Approach: It gives optimal solution if we are talking about fraction Knapsack. (By taking items according to V/W ratio). For 0/1 Knapsack it may or may