The Computational Efficiency of Ji-Lee-Li Algorithm for the Assignment Problem

Authors

  • Boris Goldengorin University of Groningen
  • Gerold Jäger Institut f¨ur Informatik, Martin-Luther-Universit¨at Halle-Wittenberg

Keywords:

Assignment Problem, Hungarian algorithm, Dual Simplex algorithm

Abstract

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

Author Biographies

Boris Goldengorin, University of Groningen

Econometrics and Operations Research Dept., associate professor

Gerold Jäger, Institut f¨ur Informatik, Martin-Luther-Universit¨at Halle-Wittenberg

Computer Science Institute, Post-doc

Downloads

Published

2008-03-25

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

Issue

Section

Short Communications