Our goal is a partition of X into disjoint sets Y1 and Y2.
Basically, we are looking a way of partitioning these items in two such as the difference between these two sets is as small as possible.
| In the minimum
partition problem, which is similar to the bin packing problem, we have
a finite set of items and for each item we have a weight. Our goal is a partition of X into disjoint sets Y1 and Y2. Basically, we are looking a way of partitioning these items in two such as the difference between these two sets is as small as possible. |
|
