Assignment problem: Difference between revisions

Revision as of 22:15, 27 January 2006

Revision as of 22:16, 27 January 2006

Line 38:

==Solving an assignment problem==

Assignment problems are generally easy to solve since there exists a one to one correspondence.

First the problem is written in the form of a matrix as given below

Line 101 ⟶ 99:

From the elements that are left, find the lowest value. Subtract this from all elements that are not struck. Add this to elements that are present at the intersection of two lines. Leave other elements unchanged. Now assign the tasks using above rules. Repeat the procedure till an assignment is possible.

[[Category:Combinatorial ptimizationoptimization]]