✦ LIBER ✦

A survey of algorithms for the generalized assignment problem

✍ Scribed by Dirk G. Cattrysse; Luk N. Van Wassenhove

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 889 KB
Volume: 60
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(92)90077-m

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on exact algorithms for the bottl

A note on exact algorithms for the bottleneck generalized assignment problem

✍ Silvano Martello; Paolo Toth 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 124 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

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

A hybrid heuristic for the generalized a

A hybrid heuristic for the generalized assignment problem

✍ Mohammad M. Amini; Michael Racer 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 344 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

Relaxation heuristics for a generalized

Relaxation heuristics for a generalized assignment problem

✍ Luiz Antonio N. Lorena; Marcelo G. Narciso 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 545 KB