Tight Approximation Algorithms for Maximum Separable Assignment Problems, Mathematics of Operations Research, vol.36, issue.3, pp.416-431, 2011. ,
DOI : 10.1287/moor.1110.0499
Generalized assignment problem, Website ,
An approximation algorithm for the generalized assignment problem, Mathematical Programming, vol.46, issue.1-3, pp.461-474, 1993. ,
DOI : 10.1007/BF01585178
A PTAS for the multiple knapsack problem, Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.213-222, 2000. ,
An efficient approximation for the Generalized Assignment Problem, Information Processing Letters, vol.100, issue.4, pp.162-166, 2006. ,
DOI : 10.1016/j.ipl.2006.06.003
Probabilistic Graphical Models: Principles and Techniques, 2009. ,
Belief Propagation for MiniMax Weight Matching, 2013. ,
DOI : 10.1007/978-3-319-18161-5_4
Auction/Belief Propagation Algorithms for Constrained Assignment Problem, 2013. ,
DOI : 10.1007/978-3-319-14974-5_23
Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality, IEEE Transactions on Information Theory, vol.54, issue.3, pp.1241-1251, 2008. ,
DOI : 10.1109/TIT.2007.915695
Belief Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions, SIAM Journal on Discrete Mathematics, vol.25, issue.2, pp.989-1011, 2011. ,
DOI : 10.1137/090753115
Equivalence of LP Relaxation and Max-Product for Weighted Matching in General Graphs, 2007 IEEE Information Theory Workshop, pp.242-247, 2007. ,
DOI : 10.1109/ITW.2007.4313081
Knapsack problem Available: http://en. wikipedia.org, Website ,
`` Strong '' NP-Completeness Results: Motivation, Examples, and Implications, Journal of the ACM, vol.25, issue.3, pp.499-508, 1978. ,
DOI : 10.1145/322077.322090