✦ LIBER ✦

An approximation algorithm for the generalized assignment problem

✍ Scribed by David B. Shmoys; Éva Tardos

Publisher: Springer-Verlag
Year: 1993
Tongue: English
Weight: 898 KB
Volume: 62
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01585178

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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 algorithm for the traffic assignment

An algorithm for the traffic assignment problem

✍ Andrés Weintraub; Jaime González 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 667 KB

An algorithm for the multiprocessor assi

An algorithm for the multiprocessor assignment problem

✍ V.F. Magirou; J.Z. Milis 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 380 KB

A branch and bound algorithm for the gen

A branch and bound algorithm for the generalized assignment problem

✍ G. Terry Ross; Richard M. Soland 📂 Article 📅 1975 🏛 Springer-Verlag 🌐 English ⚖ 578 KB