3.7.116. Hungarian method for the assignment problem

A constraint that can use the Hungarian method for the assignment problem [Kuhn55] in order to evaluate the minimum or maximum value of one of its argument. Given n persons, n tasks and a corresponding n by n cost matrix, the assignment problem is the search for an assignment of persons to tasks so that the sum of the costs is maximised.