A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Message Passing Algorithm for the Generalized Assignment Problem
[chapter]
2014
Lecture Notes in Computer Science
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− 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
doi:10.1007/978-3-662-44917-2_35
fatcat:ow5iat4ganggrnaeudbiyp7zdy