Belief Propagation for Min-Cost Network Flow: Convergence and Correctness
From MaRDI portal
Publication:2917635
DOI10.1287/opre.1110.1025zbMath1274.90455arXiv1004.1586OpenAlexW2028815884MaRDI QIDQ2917635
Devavrat Shah, Yehua Wei, David Gamarnik
Publication date: 1 October 2012
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1004.1586
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Belief propagation for the maximum-weight independent set and minimum spanning tree problems ⋮ On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems ⋮ Belief Propagation for MiniMax Weight Matching ⋮ Convergence and Correctness of Max-Product Belief Propagation for Linear Programming ⋮ Graphical models for optimal power flow ⋮ Convergence and correctness of belief propagation for the Chinese postman problem ⋮ Derandomizing Isolation in Space-Bounded Settings ⋮ A New Approach to Laplacian Solvers and Flow Problems ⋮ Self-organization scheme for balanced routing in large-scale multi-hop networks