Max-Product Belief Propagation for Linear Programming: Applications to Combinatorial Optimization


The max-product Belief Propagation (BP) is a popular message-passing heuristic for approximating a maximum-a-posteriori (MAP) assignment in a joint distribution represented by a graphical model (GM). In the past years, it has been shown that BP can solve a few classes of Linear Programming (LP) formulations to combinatorial optimization problems including… (More)


2 Figures and Tables

Slides referencing similar topics