Solving the Set Packing Problem via a Maximum Weighted Independent Set Heuristic

Abstract EN

The set packing problem (SPP) is a significant NP-hard combinatorial optimization problem with extensive applications.

In this paper, we encode the set packing problem as the maximum weighted independent set (MWIS) problem and solve the encoded problem with an efficient algorithm designed to the MWIS problem.

We compare the independent set-based method with the state-of-the-art algorithms for the set packing problem on the 64 standard benchmark instances.

The experimental results show that the independent set-based method is superior to the existing algorithms in terms of the quality of the solutions and running time obtained the solutions.