Efficient role transfer based on Kuhn-Munkres algorithm

Haibin Zhu; Mengchu Zhou

doi:10.1109/TSMCA.2011.2159587

Efficient role transfer based on Kuhn-Munkres algorithm

Haibin Zhu, Mengchu Zhou

Research output: Contribution to journal › Article › peer-review

78 Scopus citations

Abstract

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.

Original language	English (US)
Article number	5942193
Pages (from-to)	491-496
Number of pages	6
Journal	IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans
Volume	42
Issue number	2
DOIs	https://doi.org/10.1109/TSMCA.2011.2159587
State	Published - Mar 2012
Externally published	Yes

All Science Journal Classification (ASJC) codes

Software
Information Systems
Human-Computer Interaction
Electrical and Electronic Engineering
Control and Systems Engineering
Computer Science Applications

Keywords

Algorithm
emergency management
information systems
organization
role
role transfer

Access to Document

10.1109/TSMCA.2011.2159587

Cite this

@article{dcf9edcf199147c78eb5dbc5638e4d5b,

title = "Efficient role transfer based on Kuhn-Munkres algorithm",

abstract = "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.",

keywords = "Algorithm, emergency management, information systems, organization, role, role transfer",

author = "Haibin Zhu and Mengchu Zhou",

note = "Funding Information: Manuscript received November 18, 2009; revised August 27, 2010; accepted December 4, 2010. Date of publication July 7, 2011; date of current version February 17, 2012. This work was supported in part by the Natural Sciences and Engineering Research Council of Canada under Grant 262075-06, by IBM Eclipse Innovation Grant, by the National Natural Science Foundation of China under Grant 61034004, by the National Basic Research Program of China under Contract 2010CB328100, and by the Changjiang Scholars Program, PRC Ministry of Education. This paper was recommended by Associate Editor K. W. Hipel.",

year = "2012",

month = mar,

doi = "10.1109/TSMCA.2011.2159587",

language = "English (US)",

volume = "42",

pages = "491--496",

journal = "IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans",

issn = "1083-4427",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "2",

}

TY - JOUR

T1 - Efficient role transfer based on Kuhn-Munkres algorithm

AU - Zhu, Haibin

AU - Zhou, Mengchu

N1 - Funding Information: Manuscript received November 18, 2009; revised August 27, 2010; accepted December 4, 2010. Date of publication July 7, 2011; date of current version February 17, 2012. This work was supported in part by the Natural Sciences and Engineering Research Council of Canada under Grant 262075-06, by IBM Eclipse Innovation Grant, by the National Natural Science Foundation of China under Grant 61034004, by the National Basic Research Program of China under Contract 2010CB328100, and by the Changjiang Scholars Program, PRC Ministry of Education. This paper was recommended by Associate Editor K. W. Hipel.

PY - 2012/3

Y1 - 2012/3

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

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

KW - Algorithm

KW - emergency management

KW - information systems

KW - organization

KW - role

KW - role transfer

UR - http://www.scopus.com/inward/record.url?scp=84857505320&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84857505320&partnerID=8YFLogxK

U2 - 10.1109/TSMCA.2011.2159587

DO - 10.1109/TSMCA.2011.2159587

M3 - Article

AN - SCOPUS:84857505320

SN - 1083-4427

VL - 42

SP - 491

EP - 496

JO - IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans

JF - IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans

IS - 2

M1 - 5942193

ER -

Efficient role transfer based on Kuhn-Munkres algorithm

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this