# algorithms – How can I make the variance of a multiple sum of set of fixed number of variables minimum?

Here is the problem:

There are $$MN$$ people, where there are $$M$$ seeds and $$N$$ people are in each seed.
We have to make a team of $$M$$ people where everyone in the team have different seeds.
Each person have their own value; the seeds are aligned so that for any seeds $$I$$ and $$J$$ and for any $$ain I$$ and $$bin J$$, $$a or $$a>b$$ holds. Assume there are no two people with same values.

I hope that the heuristic method gives the solution with variance at most $$25%$$ larger than the optimal solution, as I don’t want to harm the balance of the team.