𝔖 Bobbio Scriptorium
✦   LIBER   ✦

(1,k)-configuration facets for the generalized assignment problem

✍ Scribed by Elsie Sterbin Gottlieb; M. R. Rao

Publisher
Springer-Verlag
Year
1990
Tongue
English
Weight
294 KB
Volume
46
Category
Article
ISSN
0025-5610

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