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

Full description

Bibliographic Details

Published in:	Neurocomputing Vol. 270; pp. 91 - 100
Main Authors:	Xu, Yun, Yan, Gangfeng, Cai, Kai, Lin, Zhiyun
Format:	Journal Article
Language:	English Japanese
Published:	Elsevier B.V 27.12.2017 Elsevier BV
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!