Efficient Role Transfer Based on Kuhn-Munkres Algorithm

Many-to-Many (M-M) role transfers are generalized problems that are encountered in collaboration. Exhaustive-search-based algorithms are too computationally intensive. This paper introduces the Kuhn-Munkres (or Hungarian) algorithm for the general assignment problems (GAPs) and proposes a new effici...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on systems, man and cybernetics. Part A, Systems and humans Vol. 42; no. 2; pp. 491 - 496
Main Authors Zhu, Haibin, Zhou, MengChu
Format Journal Article
LanguageEnglish
Published IEEE 01.03.2012
Subjects
Algorithm
Algorithms
Collaboration
Complexity theory
Computation
Converting
Cybernetics
emergency management
Gaps
Heuristic algorithms
Human
Humans
information systems
Minimization
organization
Polynomials
role
Role transfer
Online AccessGet full text
ISSN1083-4427
1558-2426
DOI10.1109/TSMCA.2011.2159587

Cover

More Information
Summary:Many-to-Many (M-M) role transfers are generalized problems that are encountered in collaboration. Exhaustive-search-based algorithms are too computationally intensive. This paper introduces the Kuhn-Munkres (or Hungarian) algorithm for the general assignment problems (GAPs) and proposes a new efficient algorithm to solve the M-M role transfer problems by converting them to the GAPs. The experiments and results validate the proposed algorithms.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1083-4427
1558-2426
DOI:10.1109/TSMCA.2011.2159587