Message Passing Algorithm for the Generalized Assignment Problem

The generalized assignment problem (GAP) is NP-hard. It is even APX-hard to approximate it. The best known approximation algorithm is the LP-rounding algorithm in [1] with a \((1-\frac{1}{e})\) approximation ratio. We investigate the max-product belief propagation algorithm for the GAP, which is suitable for distributed implementation. The basic algorithm passes an exponential number of real-valued messages in each iteration. We show that the algorithm can be simplified so that only a linear number of real-valued messages are passed in each iteration. In particular, the computation of the messages from machines to jobs decomposes into two knapsack problems, which are also present in each iteration of the LP-rounding algorithm. The messages can be computed in parallel at each iteration. We observe that for small instances of GAP where the optimal solution can be computed, the message passing algorithm converges to the optimal solution when it is unique. We then show how to add small deterministic perturbations to ensure the uniqueness of the optimum. Finally, we prove GAP remains strongly NP-hard even if the optimum is unique.

[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..