A Simple Iterative Algorithm for Boolean Knapsack Problem

The Boolean Knapsack Problem, which has numerous real life applications, is a combinatorial optimization problem. Since the problem belongs to NP-Hard, many researchers have worked on several variants of the problem. In this paper a simple iterative algorithm based on a greedy strategy to solve the classical boolean knapsack problem is proposed. In algorithm, firstly initial solutions are generated, then a greedy criteria is used to improve these solutions. To demonstrate the performance of the proposed method, experiments are carried out with various benchmark instances of boolean Knapsack Problem. The computational results show that the proposed algorithm is functional enough to achieve acceptable results in reasonable times.