According to Wikipedia, the assignment problem can be formally defined as: Given two sets, A and T, together with a weight function $C : A \times T \to R$. Find a bijection $f : A \to T$ such that the cost function: $\sum_{a \in A} C(a, f(a))$ is minimized. I now have a problem that is similar ...

Note: This is a continuation of my previous question, found here As written, my previous question was too unconstrained: @BaderAbuRadi showed that depending on the $C$ chosen, there can be multiple valid assignments that all have the same sums, no matter the $f$ chosen. To remedy this (and to avo...