Revision as of 18:01, 16 June 2023 edit 2804:431:c7d3:bed9:efbf:a554:72b6:613a (talk) →Explanation of definition ← Previous edit		Revision as of 09:21, 9 December 2023 edit undo Citation bot (talk \| contribs) Bots 5,863,449 edits Add: publisher, authors 1-1. Removed parameters. Some additions/deletions were parameter name changes. \| Use this bot. Report bugs. \| Suggested by Corvus florensis \| #UCB_webform 1540/2500 Next edit →
Line 33: \| volume = 215 \| issue = 11 \| year = 2010}}.</ref> However, there are linear-programming relaxations which give a <math>(1 - 1/e)</math>-approximation.<ref>{{cite journal \|~~last~~last1=Fleischer \|~~first~~first1=Lisa \|last2=Goemans \|first2=Michel X. \|last3=Mirrokni \|first3=Vahab S. \|last4=Sviridenko \|first4=Maxim \|title=Tight approximation algorithms for maximum general assignment problems \|date=2006}}</ref> ==Greedy approximation algorithm== Line 58: ==Further reading== {{cite book \|isbn=978-3-540-24777-7\|title=Knapsack Problems\|last1=Kellerer\|first1=Hans\|last2=Pferschy\|first2=Ulrich\|last3=Pisinger\|first3=David\|date=2013-03-19\|publisher=Springer }} [[Category:NP-complete problems]]

Generalized assignment problem: Difference between revisions