@article{ART001698092},
author={Sang-Un, Lee},
title={The Optimal Algorithm for Assignment Problem},
journal={Journal of The Korea Society of Computer and Information},
issn={1598-849X},
year={2012},
volume={17},
number={9},
pages={139-147}
TY - JOUR
AU - Sang-Un, Lee
TI - The Optimal Algorithm for Assignment Problem
JO - Journal of The Korea Society of Computer and Information
PY - 2012
VL - 17
IS - 9
PB - The Korean Society Of Computer And Information
SP - 139
EP - 147
SN - 1598-849X
AB - This paper suggests simple search algorithm for optimal solution in assignment problem. Generally, the optimal solution of assignment problem can be obtained by Hungarian algorithm. The proposed algorithm reduces the 4 steps of Hungarian algorithm to 1 step, and only selects the minimum cost of row and column then gets the optimal solution simply. For the 27 balanced and 7 unbalanced assignment problems, this algorithm finds the optimal solution but the genetic algorithm fails to find this values. This algorithm improves the time complexity of Hungarian algorithm to . Therefore, the proposed algorithm can be general algorithm for assignment problem replace Hungarian algorithm.
KW - Hungarian Algorithm;Balanced Assignment;Unbalanced Assignment;Minimum Cost;Optimal Solution
DO -
UR -
ER -
Sang-Un, Lee. (2012). The Optimal Algorithm for Assignment Problem. Journal of The Korea Society of Computer and Information, 17(9), 139-147.
Sang-Un, Lee. 2012, "The Optimal Algorithm for Assignment Problem", Journal of The Korea Society of Computer and Information, vol.17, no.9 pp.139-147.
Sang-Un, Lee "The Optimal Algorithm for Assignment Problem" Journal of The Korea Society of Computer and Information 17.9 pp.139-147 (2012) : 139.
Sang-Un, Lee. The Optimal Algorithm for Assignment Problem. 2012; 17(9), 139-147.
Sang-Un, Lee. "The Optimal Algorithm for Assignment Problem" Journal of The Korea Society of Computer and Information 17, no.9 (2012) : 139-147.
Sang-Un, Lee. The Optimal Algorithm for Assignment Problem. Journal of The Korea Society of Computer and Information, 17(9), 139-147.
Sang-Un, Lee. The Optimal Algorithm for Assignment Problem. Journal of The Korea Society of Computer and Information. 2012; 17(9) 139-147.
Sang-Un, Lee. The Optimal Algorithm for Assignment Problem. 2012; 17(9), 139-147.
Sang-Un, Lee. "The Optimal Algorithm for Assignment Problem" Journal of The Korea Society of Computer and Information 17, no.9 (2012) : 139-147.
