Content deleted Content added
m Open access bot: doi updated in citation with #oabot. |
Closing stale March merge proposal; uncontested objection and no support; see Talk:Linear bottleneck assignment problem#Merge proposal |
||
Line 1:
{{Short description|Combinatorial optimization problem}}
[[File:hungarian_algorithm_unbalanced_assignment_problem_example.svg|thumb|upright=2|Worked example of assigning tasks to an unequal number of workers using the [[Hungarian method]]]]
The '''assignment problem''' is a fundamental [[combinatorial optimization]] problem. In its most general form, the problem is as follows:
|