Generalized assignment problem: Difference between revisions

Content deleted Content added
fixed small typo in 3rd paragraph
Line 3:
This problem in its most general form is as follows:
 
There are a number of agents and a number of tasks. Any agent can be assigned to perform any task, incurring some cost and profit that may vary depending on the agent-task assignment. Moreover, each agent has a budget and the sum of the costs of tasktasks assigned to it cannot exceed this budget. It is required to find an assignment in which all agents do not exceed their budget and total profit of the assignment is maximized.
 
==Special cases==