breeze.optimize.linear
Performs greedy bipartite matching (aka competitive linking).
Performs greedy bipartite matching (aka competitive linking). Finds min matches
<n,m> matrix, m >= n
matching of size n, with values in 0..m-1, along with the score of the matching