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

Zeev Nutov; Israel Beniaminy; Raphael Yuster

doi:10.1016/j.orl.2005.05.006

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

Zeev Nutov, Israel Beniaminy, Raphael Yuster

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

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 language	English
Pages (from-to)	283-288
Number of pages	6
Journal	Operations Research Letters
Volume	34
Issue number	3
DOIs	https://doi.org/10.1016/j.orl.2005.05.006
State	Published - May 2006

Keywords

Approximation algorithm
Generalized assignment

ASJC Scopus subject areas

Software
Management Science and Operations Research
Industrial and Manufacturing Engineering
Applied Mathematics

Access to Document

10.1016/j.orl.2005.05.006

Cite this

@article{3133d6980960480c83d2a11db36e2c2b,

title = "A (1-1/e)-approximation algorithm for the generalized assignment problem",

abstract = "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.",

keywords = "Approximation algorithm, Generalized assignment",

author = "Zeev Nutov and Israel Beniaminy and Raphael Yuster",

year = "2006",

month = may,

doi = "10.1016/j.orl.2005.05.006",

language = "English",

volume = "34",

pages = "283--288",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier",

number = "3",

}

TY - JOUR

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

AU - Nutov, Zeev

AU - Beniaminy, Israel

AU - Yuster, Raphael

PY - 2006/5

Y1 - 2006/5

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

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

KW - Approximation algorithm

KW - Generalized assignment

UR - http://www.scopus.com/inward/record.url?scp=32644445035&partnerID=8YFLogxK

U2 - 10.1016/j.orl.2005.05.006

DO - 10.1016/j.orl.2005.05.006

M3 - Article

AN - SCOPUS:32644445035

SN - 0167-6377

VL - 34

SP - 283

EP - 288

JO - Operations Research Letters

JF - Operations Research Letters

IS - 3

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this