Revision as of 23:24, 9 April 2005 edit Teknic (talk \| contribs) 511 edits m →Formal mathematical definition ← Previous edit		Revision as of 21:34, 17 April 2005 edit undo Oleg Alexandrov (talk \| contribs) Extended confirmed users 47,270 edits "Spelling. This is a semi-automatic update (software suggests changes and user decides). It is likely this bot did not fix all spelling mistakes in this article." Next edit →
Line 11: The assignment problem is a special case of another optimization problem known as the [[transportation problem]], which is a special case 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. Algorithm are known 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) ~~assignemnt~~assignment problem could be relaxed, as shown in the example below. ==Example==

Assignment problem: Difference between revisions