Belief propagation for unbalanced assignment problem

DOI10.1142/s0217595922500373MaRDI QIDQ6544915

Weihua Yang, Dongyue Liang, Yajing Wang

Publication date: 28 May 2024

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

unbalanced assignment problemmessage-passing algorithmpseudo-polynomial timemin-cost network flow problembelief propagation (BP)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Theory of organizations, manpower planning in operations research (90B70) Matching models (91B68)

Cites Work

• Unnamed Item
• Unnamed Item
• Convergence and correctness of belief propagation for the Chinese postman problem
• A modified method for solving the unbalanced assignment problems
• Belief Propagation for Min-Cost Network Flow: Convergence and Correctness
• Analysis of the Min-Sum Algorithm for Packing and Covering Problems via Linear Programming
• Belief Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions
• Finding minimum-cost circulations by canceling negative cycles
• Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality
• The generalized distributive law
• On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs
• Implementation and Testing of a Primal-Dual Algorithm for the Assignment Problem
• Message Passing for Maximum Weight Independent Set

This page was built for publication: Belief propagation for unbalanced assignment problem