Partition problem is to determine whether a given set can be partitioned into two subsets such that the sum of elements in both subsets is the same. The partition problem is NP-complete. In our ...

There is presented a genetic, tabu serach and scatter search algorithms for solving the set partitioning problem (SPP). The set partitioning problem is a combinatorial problem used by airlines as a ...

An algorithm for solving the continuous optimal sets partitioning problem with constrains for the centers location, which is based on usage of the optimal partitioning theory from n-dimensional ...

The Set Partitioning Problem (SPP) aims to obtain non-empty disjoint subsets of objects such that their union equals the whole set of objects, and the partition meets some prespecified criteria. The ...