language-icon Old Web
English
Sign In

Assignment problem

The assignment problem is a fundamental combinatorial optimization problem. It consists of finding, in a weighted bipartite graph, a matching in which the sum of weights of the edges is as large as possible. A common variant consists of finding a minimum-weight perfect matching. The assignment problem is a fundamental combinatorial optimization problem. It consists of finding, in a weighted bipartite graph, a matching in which the sum of weights of the edges is as large as possible. A common variant consists of finding a minimum-weight perfect matching. It is a specialization of the maximum weight matching problem for bipartite graphs.

[ "Algorithm", "Combinatorics", "Mathematical optimization", "Hungarian algorithm", "quadrangle inequality", "Generalized assignment problem", "General assignment" ]
Parent Topic
Child Topic
    No Parent Topic