A new polynomial time algorithm for 0–1 multiple knapsack problem based on dominant principles

摘要

This paper presents a heuristic to solve the 0–1 multi-constrained knapsack problem (01MKP) which is NP-hard. In this heuristic the dominance property of the constraints is exploited to reduce the search space to find near optimal solutions of 01MKP. This heuristic is tested for 10 benchmark problems of sizes up to 105 and for seven classical problems of sizes up to 500, taken from the literature and the results are compared with optimum solutions. Space and computational complexity of solving 01MKP using this approach are also presented. The encouraging results especially for relatively large size test problems indicate that this heuristic can successfully be used for finding good solutions for highly constrained NP-hard problems.