KJCKorea
Journal Central

@article{ART002022586},
author={Sang-Un, Lee},
title={An Assignment Problem Algorithm Using Minimum Cost Moving Method},
journal={Journal of The Korea Society of Computer and Information},
issn={1598-849X},
year={2015},
volume={20},
number={8},
pages={105-112}

TY - JOUR
AU - Sang-Un, Lee
TI - An Assignment Problem Algorithm Using Minimum Cost Moving Method
JO - Journal of The Korea Society of Computer and Information
PY - 2015
VL - 20
IS - 8
PB - The Korean Society Of Computer And Information
SP - 105
EP - 112
SN - 1598-849X
AB - Generally, the optimal solution of assignment problem has been obtained by Hungarian algorithm with O(n3) time complexity. This paper proposes more simple algorithm with O(n2) time complexity than Hungarian algorithm. The proposed algorithm simply selects minimum cost in each row, and classified into set S, H, and T. Then, the minimum cost is moved from S to T and S→H, H→T . The proposed algorithm can be obtain the same optimal solution as well-known algorithms and improve the optimal solution of partial unbalanced assignment problems.
KW - Hungarian algorithm;Balanced assignment;Unbalanced assignment;Minimum cost;Optimal solution
DO -
UR -
ER -

Sang-Un, Lee. (2015). An Assignment Problem Algorithm Using Minimum Cost Moving Method. Journal of The Korea Society of Computer and Information, 20(8), 105-112.

Sang-Un, Lee. 2015, "An Assignment Problem Algorithm Using Minimum Cost Moving Method", Journal of The Korea Society of Computer and Information, vol.20, no.8 pp.105-112.

Sang-Un, Lee "An Assignment Problem Algorithm Using Minimum Cost Moving Method" Journal of The Korea Society of Computer and Information 20.8 pp.105-112 (2015) : 105.

Sang-Un, Lee. An Assignment Problem Algorithm Using Minimum Cost Moving Method. 2015; 20(8), 105-112.

Sang-Un, Lee. "An Assignment Problem Algorithm Using Minimum Cost Moving Method" Journal of The Korea Society of Computer and Information 20, no.8 (2015) : 105-112.

Sang-Un, Lee. An Assignment Problem Algorithm Using Minimum Cost Moving Method. Journal of The Korea Society of Computer and Information, 20(8), 105-112.

Sang-Un, Lee. An Assignment Problem Algorithm Using Minimum Cost Moving Method. Journal of The Korea Society of Computer and Information. 2015; 20(8) 105-112.

Sang-Un, Lee. An Assignment Problem Algorithm Using Minimum Cost Moving Method. 2015; 20(8), 105-112.

Sang-Un, Lee. "An Assignment Problem Algorithm Using Minimum Cost Moving Method" Journal of The Korea Society of Computer and Information 20, no.8 (2015) : 105-112.