✦ LIBER ✦

An Improved Dual Based Algorithm for the Generalized Assignment Problem

✍ Scribed by Monique Guignard and Moshe B. Rosenwein

Book ID: 123687403
Publisher: INFORMS
Year: 1989
Tongue: English
Weight: 239 KB
Volume: 37
Category: Article
ISSN: 0030-364X
DOI: 10.2307/171267

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for the bottleneck generali

An algorithm for the bottleneck generalized assignment problem

✍ Joseph B. Mazzola; Alan W. Neebe 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 737 KB

An approximation algorithm for the gener

An approximation algorithm for the generalized assignment problem

✍ David B. Shmoys; Éva Tardos 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 898 KB

An Improved Algorithm for the Bottleneck

An Improved Algorithm for the Bottleneck Assignment Problem

✍ Robert S. Garfinkel 📂 Article 📅 1971 🏛 INFORMS 🌐 English ⚖ 179 KB

An effective subgradient algorithm for t

An effective subgradient algorithm for the generalized assignment problem

✍ T.D. Klastorin 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 850 KB

An improved origin-based algorithm for s

An improved origin-based algorithm for solving the combined distribution and assignment problem

✍ Meng Xu; Anthony Chen; Ziyou Gao 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 406 KB

A (1–)-approximation algorithm for the g

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

✍ Zeev Nutov; Israel Beniaminy; Raphael Yuster 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 173 KB

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