Akgül, M.2019-02-192019-02-1919880167-6377http://hdl.handle.net/11693/49601We present a sequential dual-simplex algorithm for the linear problem which has the same complexity as the algorithms of Balinski [3,4] and Goldfarb [8]: O(n2) pivots, O(n2 log n + nm) time. Our algorithm works with the (dual) strongly feasible trees and can handle rectangular systems quite naturally.EnglishLinear assignment problemDual-simplexStrongly feasible treesPolynomial algorithmsA sequential dual simplex algorithm for the linear assignment problemArticle10.1016/0167-6377(88)90082-X1872-7468