- #1

- 2

- 0

given a set of 'n' numbers. I have to find the optimal disjoint subset distribution of the set which minimizes the value given by a function ( The function values over each of the subsets are added to give the total value corresponding to a subset distribution). There's no polynomial formula for the function, the value is computed using a set of rules based on previous results. The function value can be calculated using a code for a given set. The upper bound is the sum of all the numbers in the set and the lower bound is the largest number in the set.

The order of appearance of numbers in the subset is important (being time values). Within each susbset of the distribution an element appearing prior to a latter element should have a lower indice in the original set.

Any suggestion will be highly appreciated. Thanks to all