A sequential dual simplex algorithm for the linear assignment problem

Authors:
Mustafa Akgül
Affiliations:
Dept. of Industrial Engineering, Bilkent University, P.K. 8, 06572, Maltepe, Ankara, Turkey
Venue:
Operations Research Letters
Year:
1988

Citing 3
Cited 1

Data structures and network algorithms

Data structures and network algorithms
A competitive (dual) simplex method for the assignment problem

Mathematical Programming: Series A and B
Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)

A primal-dual simplex method for linear programs

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We 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(n^2) pivots, O(n^2 log n + nm) time. Our algorithm works with the (dual) strongly feasible trees and can handle rectangular systems quite naturally.