Revision as of 22:03, 29 October 2014 edit 2620:0:1019:5:69e2:7690:f237:d627 (talk) No edit summary ← Previous edit		Revision as of 22:04, 29 October 2014 edit undo 2620:0:1019:5:69e2:7690:f237:d627 (talk) No edit summary Next edit →
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==

Generalized assignment problem: Difference between revisions