Solving the Set Packing Problem via a Maximum Weighted Independent Set Heuristic
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 MWI...
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2020-01-01
|
| Series: | Mathematical Problems in Engineering |
| Online Access: | http://dx.doi.org/10.1155/2020/3050714 |