Content deleted Content added
New section inserted by anon at the bottom is big mess |
m Changing {{cleanup}} to {{cleanup-date|December 2005}} |
||
Line 1:
{{cleanup-date|December 2005}}
The '''assignment problem''' is one of fundamental [[combinatorial optimization]] problems in the branch of [[optimization]] or [[operations research]] in [[mathematics]].
Line 100:
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:Optimization]]
| |||