Generalized assignment problem: Difference between revisions

Revision as of 15:36, 19 November 2007

Revision as of 17:06, 6 December 2007

Line 1:

In economics, the maximum '''general assignment problem''' is a problem in [[combinatorial optimization]]. This problem is a [[generalization]] of the [[assignment problem]] in which both [[tasktasks]] 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:

Line 48:

| id = ISBN 3-540-40286-1

}}

==See also==

*[[Assignment problem]]

[[Category:NP-complete problems]]