Estimates the time needed for brute force optimal assignment for group size 10.

hungarian2.py

%%timeit
# Second gist for Hungarian post.
# Estimates the time needed for brute force optimal assignment for group size 10. 
# Takes about 3 minutes.
maxsums, colixs = [], []
group_size = 10
np.random.seed(0)
preferences = np.random.rand(group_size,group_size)

rowix = list(range(group_size)) # rows don't need to be permuted
# Permute choice of columns. 
for colix in itertools.permutations(range(group_size)):
    _sum = np.sum(preferences[rowix,colix])
    maxsums.append(_sum)
    colixs.append(colix)
maxsum = np.max(maxsums)
maxcolix = colixs[np.argmax(maxsums)]
print("Total preference:", maxsum)
print("Row:",rowix, "Col:", maxcolix)