A distributed message passing algorithm for computing perfect demand matching

In this paper, we consider the perfect demand matching problem (PDM) which combines aspects of the knapsack problem along with the b-matching problem. It is a generalization of the maximum weight matching problem which has been fundamental in the development of theory of computer science and operati...

Full description

Bibliographic Details

Published in:	Journal of parallel and distributed computing Vol. 179; p. 104706
Main Authors:	Dai, Guowei, Chen, Yannan, Mao, Yaping, Xu, Dachuan, Zhang, Xiaoyan, Zhang, Zan-Bo
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.09.2023
Subjects:	Belief propagation Distributed algorithm Linear programming dual Message passing Perfect demand matching Perfect demand matching Message passing Distributed algorithm Linear programming dual Belief propagation
ISSN:	0743-7315, 1096-0848
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!