Content deleted Content added
mNo edit summary |
No edit summary |
||
Line 9:
Other kinds are the [[quadratic assignment problem]], [[bottleneck assignment problem]].
The assignment problem is a special case of another optimization problem known as the [[transportation problem]], which is a special case of the [[maximal flow problem]], which in turn is a special case of a [[linear program]]. While it is possible to solve any of these problems using the [[simplex algorithm]], each problem has more efficient algorithms designed to take advantage of its special structure. Algorithms have been devised that solve the linear assignment problem within time bounded by a polynomial expression of the number of agents.
The restrictions on agents, tasks and cost in the (linear) assignment problem could be relaxed, as shown in the example below.
| |||