A problem arose to solve the problem with a solution that became impracticable. Well, I have a set of 12 elements that represent quantities: $$\Omega = \{16, 132, 135, 135, 136, 138, 138, 139, 301, 334, 355, 361\}$$ I can join elements, get subsets, of this set such that the sum of the elements does […]

Categories

## Combinatorial optimization (find partitions)

- Post author By Q+A Expert
- Post date March 27, 2020
- No Comments on Combinatorial optimization (find partitions)

- Tags "334", [132, \{355\}\}$$ The associated totals, \{361\}\}$$ $$S_2 = \{ \{16, $$S_1 = \{ \{16, 135, 136, 138, 139, 267$ and $\sigma^2_{T_2} = 1780, 301), 355, 355\}$$ Which has as variances $\sigma^2_{T_1} = 4952, 361, 361\}$$ $$T_2 = \{431, 361\}$$ I can join elements, 406, 412, 440, 493, 667$. Therefore, A problem arose to solve the problem with a solution that became impracticable. Well, any text on something like that, any tips? Sorry for the informality and abuse of notation, consider the two possible partitions, for example, generate all partitions and search for the optimal partition, get subsets, I have a set of 12 elements that represent quantities: $$\Omega = \{16, it was computationally infeasible. I wonder if there is a better approach, of this set such that the sum of the elements does not exceed 533, partition $S_2$ is preferable. I know that my partition has to have only 6 elements and when using my approach, so I have a subset $S$ that does not accept any more elements. The problem is basically to find the $\Omega$ partition that has the least nu, sum of the elements of the subsets, Thank you in advance., the sum of the first 4 elements of the set is equal to 418, to each element for the two partitions are respectively $$T_1 = \{418