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

Zeev Nutov, Israel Beniaminy, Raphael Yuster

Research output: Contribution to journalArticlepeer-review


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 12.

Original languageEnglish
Pages (from-to)283-288
Number of pages6
JournalOperations Research Letters
Issue number3
StatePublished - May 2006


  • Approximation algorithm
  • Generalized assignment


Dive into the research topics of 'A (1-1/e)-approximation algorithm for the generalized assignment problem'. Together they form a unique fingerprint.

Cite this