Content deleted Content added
Line 6:
==Special cases==
In the special case in which all the agents' budgets and all tasks' costs are equal to 1, this problem reduces to the [[maximum assignment problem]]. When the costs and profits of all agents-task assignment are equal, this problem reduces to the [[multiple knapsack problem]]. If there is a single agent, then, this problem reduces to the [[Knapsack problem]].
==Definition==
| |||