Change search
ReferencesLink to record
Permanent link

Direct link
The Computational Efficiency of Ji-Lee-Li Algorithm for the Assignment Problem
Faculty of Economics and Business, University of Groningen, The Netherlands.
Computer Science Institute, University of Halle-Wittenberg, D-06099 Halle (Saale), Germany.
2008 (English)In: Algorithmic Operations Research, ISSN 1718-3235, Vol. 3, no 1, 79-81 p.Article in journal (Refereed) Published
Abstract [en]

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.

Place, publisher, year, edition, pages
Preeminent Academic Facets , 2008. Vol. 3, no 1, 79-81 p.
Keyword [en]
Assignment problem, Hungarian algorithm, dual simplex algorithm
National Category
Discrete Mathematics
URN: urn:nbn:se:umu:diva-82882OAI: diva2:663880
Available from: 2013-11-13 Created: 2013-11-12 Last updated: 2014-02-11Bibliographically approved

Open Access in DiVA

No full text

Other links

Search in DiVA

By author/editor
Jäger, Gerold
Discrete Mathematics

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 21 hits
ReferencesLink to record
Permanent link

Direct link