The computational efficiency of Ji–Lee–Li algorithm for the assignment problem

The computational efficiency of Ji–Lee–Li algorithm for the assignment problem

0.00 Avg rating0 Votes
Article ID: iaor20084697
Country: Canada
Volume: 3
Issue: 1
Publication Date: Jan 2008
Journal: Algorithmic Operations Research
Authors: ,
Keywords: programming: linear
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.

Reviews

Required fields are marked *. Your email address will not be published.