Описание тега hungarian-algorithm
The Hungarian algorithm is a combinatorial optimization algorithm that solves the assignment problem, that of finding a maximum weight matching in a bipartite graph, in polynomial time.
A description of the algorithm can be found in this Wikipedia article.