C#-only solver for the rectangular linear assignment problem, also known as the minimum weight full matching problem for bipartite graphs. Algorithms used include shortest augmenting path search and cost-scaling pseudoflow based assignment.