1.
Combinatorial interior point methods for generalized network flow problems
by GOLDFARB, Donald
Mathematical programming, 2002, Vol.93 (2), p.227-246
2.
A polynomial dual simplex algorithm for the generalized circulation problem
by GOLDFARB, Donald
Mathematical programming, 2002, Vol.91 (2), p.271-288
3.
An O(nm)-Time Network Simplex Algorithm for the Shortest Path Problem
by Goldfarb, Donald
Operations research, 1999-05-01, Vol.47 (3), p.445-448
4.
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
5.
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
6.
Efficient Shortest Path Simplex Algorithms
by Goldfarb, Donald
Operations research, 1990-07-01, Vol.38 (4), p.624-628
7.
On strongly polynomial dual simplex algorithms for the maximum flow problem
by GOLDFARB, D
Mathematical programming, 1997, Vol.78 (2), p.159-168
8.
A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and O(n2m) time
by GOLDFARB, D
Mathematical programming, 1990, Vol.47 (3), p.353-365
9.
Strongly polynomial dual simplex methods for the maximum flow problem
by ARMSTRONG, R. D
Mathematical programming, 1998, Vol.80 (1), p.17-33
Filter electronic articles 9 Hits
Remove Filters
- Applied Sciences (9)
- Operational Research. Management... (9)
- Operational Research And Scienti... (9)
- Exact Sciences And Technology (9)
- Flows In Networks. Combinatorial Problems
- Mathematics (9)
- Physical Sciences (7)
- Mathematics, Applied (7)
- Algorithms (6)
- Computer Science, Software Engin... (5)
- Computer Science (5)
- Strongly Polynomial (4)
- Simplex Method (4)
- Minimization Of Cost (4)
- Generalized Maximum Flow (3)
- Analysis (3)
- Generalized Circulation (3)
- less ...