Set packing is a classical NP-complete problem in computational complexity theory and combinatorics, and was one of Karp's 21 NP-complete problems. Suppose one has a finite set S and a list of subsets ...
The Set Packing Problem is a combinatorial decision problem where the objective is to determine if there exists a collection of disjoint subsets from a given set of subsets such that the collection ...
Abstract: In this paper we investigate the application of memetic algorithm (MA) to the k-set packing problem, a well-known $N$ P-hard problem with applications in ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results