1.
Combinatorial interior point methods for generalized network flow problems
by GOLDFARB, Donald
Mathematical programming, 2002, Vol.93 (2), p.227-246
2.
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
3.
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
4.
The Ellipsoid Method: A Survey
by Bland, R.G
Operations research, 1981-11-01, Vol.29 (6), p.1039-1091
5.
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
6.
A primal projective interior point method for linear programming
by GOLDFARB, D
Mathematical programming, 1991, Vol.51 (1), p.17-43
7.
Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value
by GOLDFARB, D
Mathematical programming, 1988, Vol.40 (2), p.183-195
8.
A relaxed version of Karmarkar's method
by GOLDFARB, D
Mathematical programming, 1988, Vol.40 (3), p.289-315
9.
Modifications and implementation of the ellipsoid algorithm for linear programming
by Goldfarb, Donald
Mathematical programming, 1982-12, Vol.23 (1), p.1-19
Filter electronic articles 9 Hits
Remove Filters
- Subjects
- Linear Programming
- Science & Technology (8)
- Technology (8)
- more ...