Category:Assignment problem

The assignment problem consists of finding, in a weighted bipartite graph, a matching of maximum size, in which the sum of weights of the edges is minimum. The assignment problem is a special case of the transportation problem, which is a special case of the minimum cost flow problem, which in turn is a special case of a linear program.

Category:Minimum cost flow problem

Pages in category "Category:Assignment problem"

Category:Minimum cost flow problem