1.
A Faster Combinatorial Algorithm for the Generalized Circulation Problem
by Goldfarb, Donald
Mathematics of operations research, 1996-08-01, Vol.21 (3), p.529-539

2.
Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem
by Goldfarb, Donald
Mathematics of operations research, 1997-11-01, Vol.22 (4), p.793-802

3.
The Ellipsoid Method: A Survey
by Bland, R.G
Operations research, 1981-11-01, Vol.29 (6), p.1039-1091

4.
An O(nm)-time network simple algorithm for the shortest path problem
by Donald Goldfarb
Operations research, 1999-05-01, Vol.47 (3), p.445

5.
Efficient Shortest Path Simplex Algorithms
by Goldfarb, Donald
Operations research, 1990-07-01, Vol.38 (4), p.624-628

6.
On the Complexity of a Class of Projective Interior Point Methods
by Goldfarb, Donald
Mathematics of operations research, 1995-02-01, Vol.20 (1), p.116-134
