Message Passing Algorithm for the Generalized Assignment Problem
暂无分享,去创建一个
Jun Li | Yannis Pavlidis | Wei Shen | Shen Li | Chong Jiang | Mindi Yuan
[1] Nir Friedman,et al. Probabilistic Graphical Models - Principles and Techniques , 2009 .
[2] Yannis Pavlidis,et al. Belief Propagation for MiniMax Weight Matching , 2015, MCO.
[3] Sujay Sanghavi. Equivalence of LP Relaxation and Max-Product for Weighted Matching in General Graphs , 2007, 2007 IEEE Information Theory Workshop.
[4] David S. Johnson,et al. `` Strong '' NP-Completeness Results: Motivation, Examples, and Implications , 1978, JACM.
[5] Vahab S. Mirrokni,et al. Tight approximation algorithms for maximum general assignment problems , 2006, SODA '06.
[6] Devavrat Shah,et al. Maximum weight matching via max-product belief propagation , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..
[7] M. Bayati,et al. Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality , 2005, IEEE Transactions on Information Theory.
[8] Christian Borgs,et al. Belief Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions , 2007, SIAM J. Discret. Math..
[9] Jun Li,et al. Auction/Belief Propagation Algorithms for Constrained Assignment Problem , 2015, CALDAM.
[10] Éva Tardos,et al. An approximation algorithm for the generalized assignment problem , 1993, Math. Program..
[11] Sanjeev Khanna,et al. A PTAS for the multiple knapsack problem , 2000, SODA '00.
[12] Reuven Cohen,et al. An efficient approximation for the Generalized Assignment Problem , 2006, Inf. Process. Lett..