Generalized assignment problem: Difference between revisions

Revision as of 12:56, 26 January 2007

Revision as of 12:58, 26 January 2007

Line 1:

<math>Insert formula here</math>The maximum general assignment problem is a problem in combinatorial optimization. This problem is a generalization of the assignment problem in which both task and agents have a size. Moreover, this size of each task might vary from one agent to the other. This proproblem

<br />

Line 7:

==Special cases ==

----

==

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.