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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of parallel and distributed computing Jg. 179; S. 104706
Hauptverfasser:	Dai, Guowei, Chen, Yannan, Mao, Yaping, Xu, Dachuan, Zhang, Xiaoyan, Zhang, Zan-Bo
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Inc 01.09.2023
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!