Revision as of 16:14, 11 February 2017 edit Magioladitis (talk \| contribs) Extended confirmed users, Rollbackers 908,596 edits m clean up using AWB ← Previous edit		Revision as of 17:16, 10 June 2017 edit undo Magic links bot (talk \| contribs) Bots 291,110 edits m Replace magic links with templates per local RfC and MediaWiki RfC Next edit →
Line 51: * Reuven Cohen, Liran Katzir, and Danny Raz, [http://www.cs.technion.ac.il/~lirank/pubs/2006-IPL-Generalized-Assignment-Problem.pdf "An Efficient Approximation for the Generalized Assignment Problem"], Information Processing Letters, Vol. 100, Issue 4, pp. 162–166, November 2006. * Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, and Maxim Sviridenko, [http://www-math.mit.edu/~goemans/PAPERS/ga-soda06.pdf "Tight Approximation Algorithms for Maximum General Assignment Problems"], SODA 2006, pp. 611–620. * Hans Kellerer, Ulrich Pferschy, David Pisinger, ''Knapsack Problems '', 2005. Springer Verlag {{ISBN \|3-540-40286-1}} == External links ==

Generalized assignment problem: Difference between revisions