The unbounded knapsack problem: given a knapsack of some capacity and a set of items that have a weight and a value, determine the maximum value of items you can place in your knapsack. The number of ...

Abstract: Dynamic programming is a fundamental algorithm that can be found in our daily lives easily. One of the dynamic programming algorithm implementations consists of solving the 0/1 knapsack ...

Abstract: The knapsack problem a NP-hard problem which plays significant roles in many practical applications. In this paper, a new cognitive behavior optimization algorithm (COA) is used to ...