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.
|