Fast centralized integer resource allocation algorithm and its distributed extension over digraphs

This paper studies the resource allocation problem with convex objective functions, subject to individual resource constraints, equality constraints, and integer constraints. The goal is to minimize the total cost when allocating the total resource D to n agents. We propose a novel min-heap and opti...

Celý popis

Podrobná bibliografia

Vydané v:	Neurocomputing Ročník 270; s. 91 - 100
Hlavní autori:	Xu, Yun, Yan, Gangfeng, Cai, Kai, Lin, Zhiyun
Médium:	Journal Article
Jazyk:	English Japanese
Vydavateľské údaje:	Elsevier B.V 27.12.2017 Elsevier BV
Predmet:	Consensus Distributed algorithm Min-heap Resource allocation Strongly connected digraph Consensus Strongly connected digraph Resource allocation Distributed algorithm Min-heap
ISSN:	0925-2312, 1872-8286
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!