Generalized assignment problem: Difference between revisions

Revision as of 01:13, 11 February 2018

Revision as of 21:14, 6 June 2019

Line 1:

{{short description|combinatorial optimization problem}}

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 [[Agent-based model|agents]] have a size. Moreover, the size of each task might vary from one agent to the other.