The Computational Efficiency of Ji-Lee-Li Algorithm for the Assignment Problem
Keywords:Assignment Problem, Hungarian algorithm, Dual Simplex algorithm
AbstractJi et al. have conjectured that using the matrix form (to represent a basic solution) instead of the Simplex tableau in the dual Simplex method will lead to an algorithm with the time complexity comparable to the Hungarian algorithm for solving the Assignment Problem. In this note we show that both the time complexity and the CPU times of the Ji et al. algorithm are far away from being competitive to the Hungarian algorithm.
How to Cite
Goldengorin, B., & Jäger, G. (2008). The Computational Efficiency of Ji-Lee-Li Algorithm for the Assignment Problem. Algorithmic Operations Research, 3(1). Retrieved from https://journals.lib.unb.ca/index.php/AOR/article/view/1240