A Network Flow Algorithm for Solving Generalized Assignment Problem

The generalized assignment problem (GAP) is an open problem in which an integer k is given and one wants to assign k ′ agents to k k ′ ≤ k jobs such that the sum of the corresponding cost is minimal. Unlike the traditional K -cardinality assignment problem, a job can be assigned to many, but differe... View More