A (1–1/e1/e)-approximation algorithm for the generalized assignment problem

We give a (1–1/e1/e)-approximation algorithm for the max-profit generalized assignment problem (Max-GAP) with fixed profits   when the profit (but not necessarily the size) of every item is independent from the bin it is assigned to. The previously best-known approximation ratio for this problem was 12.