Content deleted Content added
Citation bot (talk | contribs) Add: eprint, class. Removed parameters. Some additions/deletions were actually parameter name changes. | You can use this bot yourself. Report bugs here. | Suggested by Headbomb | via #UCB_toolbar |
Tom.Reding (talk | contribs) m +{{Authority control}} (2 IDs from Wikidata), WP:GenFixes on |
||
Line 1:
{{
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.
Line 104:
* {{cite book | author-link = Rainer Burkard | first = Rainer | last = Burkard |author2=M. Dell'Amico|author3=S. Martello | year = 2012 | title = Assignment Problems (Revised reprint) | publisher = SIAM | isbn = 978-1-61197-222-1 }}
* {{cite book | author-link = Dimitri Bertsekas | first = Dimitri | last = Bertsekas | year = 1998 | title = Network Optimization: Continuous and Discrete Models | publisher = Athena Scientific | isbn = 978-1-886529-02-1 }}
{{Authority control}}
[[Category:Combinatorial optimization]]
| |||