Generalized assignment problem: Difference between revisions

Revision as of 15:44, 8 April 2008

Revision as of 20:52, 29 May 2008

Line 34:

== References ==

{{references}}

* [http://www.cs.technion.ac.il/~lirank/pubs/2006-IPL-Generalized-Assignment-Problem.pdf'''An Efficient Approximation for the Generalized Assignment Problem'''], Cohen, Katzir, and Raz, 2006.

== Further readings ==

* [http://www-math.mit.edu/~goemans/ga-soda06.pdf '''Tight Approximation Algorithms for Maximum General Assignment Problems'''],

* Katzir Cohen and Raz (2006). [http://www.cs.technion.ac.il/~lirank/pubs/2006-IPL-Generalized-Assignment-Problem.pdf''' "An Efficient Approximation for the Generalized Assignment Problem'''"], Cohen, Katzir, and Raz, 2006.

Fleischer, Goemans, Mirrokni, and Sviridenko, 2006.

* Fleischer, Goemans, Mirrokni, and Sviridenko (2006). [http://www-math.mit.edu/~goemans/ga-soda06.pdf '''"Tight Approximation Algorithms for Maximum General Assignment Problems'''"],

* Hans Kellerer and U. Pferschy D. Pisinger (2005). ''Knapsack Problems ''. Springer Verlag ISBN 3-540-40286-1

* {{cite book

| authorlink = Hans | Kellerer

| first = Hans | Kellerer

| coauthors = U. Pferschy D. Pisinger

| year = 2005

| title = Knapsack Problems

| publisher = Springer Verlag

| id = ISBN 3-540-40286-1

}}

==See also==