Revision as of 13:13, 26 January 2007 edit LiranKatzir (talk \| contribs) 63 edits →Definition ← Previous edit		Revision as of 13:15, 26 January 2007 edit undo LiranKatzir (talk \| contribs) 63 edits →Special cases 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[[Knapsack problem]]. ==Definition==

Generalized assignment problem: Difference between revisions