Generalized assignment problem: Difference between revisions

Content deleted Content added
m Fix links to disambiguation page Task
Line 1:
In [[applied mathematics]], the maximum '''generalized assignment problem''' is a problem in [[combinatorial optimization]]. This problem is a [[generalization]] of the [[assignment problem]] in which both [[tasks]] and [[agents]] have a size. Moreover, the size of each task might vary from one agent to the other.
 
This problem in its most general form is as follows: