Content deleted Content added
COPknowledge (talk | contribs) |
COPknowledge (talk | contribs) m Added generalization of the wto-dimensional assignment problem to multiple dimensions (i.e., two or more), which is the MAP |
||
Line 88:
When phrased as a graph theory problem, the assignment problem can be extended from [[bipartite graph]]s to arbitrary graphs. The corresponding problem, of finding a [[matching (graph theory)|matching]] in a [[weighted graph]] where the sum of weights is maximized, is called the [[maximum weight matching|maximum weight matching problem]].
Another generalization of the assignment problem is extending the number of sets to be matched from two to many. So that rather than matching agents to tasks, the problem is extended to matching agents to tasks to time intervals to locations. This results in [[Multidimensional assignment problem (MAP)]].
==See also==
| |||