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

Full description

Saved in:
Bibliographic Details
Published inOperations research letters Vol. 34; no. 3; pp. 283 - 288
Main Authors Nutov, Zeev, Beniaminy, Israel, Yuster, Raphael
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 01.05.2006
Elsevier
Subjects
Applied sciences
Approximation algorithm
Exact sciences and technology
Generalized assignment
Operational research. Management science
Approximation algorithm
Generalized assignment
Best approximation
Profit
Assignment problem
Online AccessGet full text

Cover

More Information
Summary: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 .
ISSN:0167-6377
1872-7468
DOI:10.1016/j.orl.2005.05.006