Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

ORL
2006

favoriteEmaildiscussreport

114views more ORL 2006»

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

13 years 4 months ago

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

Download www.openu.ac.il

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. Key-words. Generalized assignment, Approximation algorithm.

Zeev Nutov, Israel Beniaminy, Raphael Yuster

Real-time Traffic

Algorithm | Generalized Assignment Problem | ORL 2006 |

claim paper

Related Content

» Approximation algorithms for allocation problems Improving the factor of 1 1e

» Tight informationtheoretic lower bounds for welfare maximization in combinatorial auctions

» Minimizing Request Blocking in AllOptical Rings

» A BranchandPrice Algorithm for the Multilevel Generalized Assignment Problem

» An improved hybrid genetic algorithm for the generalized assignment problem

» A swarm based approximated algorithm to the extended generalized assignment problem EGAP

» Joint Routing Channel Assignment and Scheduling for Throughput Maximization in General Int...

» An Algorithm for Construction of Test Cases for the Quadratic Assignment Problem

» An efficient approximation for the Generalized Assignment Problem

Post Info
More Details (n/a)

Added	14 Dec 2010
Updated	14 Dec 2010
Type	Journal
Year	2006
Where	ORL
Authors	Zeev Nutov, Israel Beniaminy, Raphael Yuster

Comments (0)