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

We give a (1 - 1/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 1/2. Key-words. Generalized assignment, Approximation algorithm.

• Type: Journal
• Year: 2006
• Where: ORL
• Authors: Zeev Nutov, Israel Beniaminy, Raphael Yuster
• Keywords: Algorithm, Generalized Assignment Problem, ORL 2006