Content deleted Content added
Changed reference from the arxiv preprint to a newer published journal article. |
→top: Add Hungarian algorithm worked example |
||
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:
:The problem instance has a number of ''agents'' and a number of ''tasks''. Any agent can be assigned to perform any task, incurring some ''cost'' that may vary depending on the agent-task assignment. It is required to perform as many tasks as possible by assigning at most one agent to each task and at most one task to each agent, in such a way that the ''total cost'' of the assignment is minimized.
| |||