Reputation
Top tag
Next privilege 200 Rep.
See reduced ads
Badges
2
Newest
 Teacher
Impact
~2k people reached

  • 0 posts edited
  • 0 helpful flags
  • 0 votes cast
Jun
17
comment Partitioning set into subsets with respect to equality of sum among subsets
And this C# version (hakank.org/or-tools/partition_into_subsets_of_equal_values2.cs) solves the problem with 100000 random integers (in the ranges of 1..10, 1..100 as well as 1..1000) in about 3 seconds.
Jun
17
comment Partitioning set into subsets with respect to equality of sum among subsets
Some more about performance: I've tested the MiniZinc model with 100 and 1000 random integers in the range 1..10 (1..100): the first solution is shown in a few milliseconds. For 10000 random integers (in the range 1..10) then it took a little bit longer: about 3 seconds after about 20 seconds of generating the intermediate FlatZinc format. This variant is here: hakank.org/minizinc/partition_into_subset_of_equal_values2.mzn (it's 28kB).
Jun
17
awarded  Teacher
Jun
17
answered Partitioning set into subsets with respect to equality of sum among subsets
Jan
21
awarded  Autobiographer