Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Donald Goldfarb
Information about the author Donald Goldfarb will soon be added to the site.
Found
14 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
A new scaling algorithm for the minimum cost network flow problem
1999
In this paper, we present a new polynomial time algorithm for solving the minimum cost...
Polynomial-time highest-gain augmenting path algorithms for the generalized circulation problem
1997
The paper presents two new combinatorial algorithms for the generalized circulation...
Robust portfolio selection problems
2003
In this paper we show how to formulate and solve robust portfolio selection problems....
An O(nm)-time network simplex algorithm for the shortest path problem
1999
We present an O(nm) -time network simplex algorithm for finding a tree of shortest...
Strongly polynomial dual simplex methods for the maximum flow problem
1998
This paper presents dual network simplex algorithms that require at most 2 nm pivots...
On strongly polynomial dual simplex algorithms for the maximum flow problem
1997
Several pivot rules for the dual network simplex algorithm that enable it to solve a...
Data-parallel implementations of dense simplex methods on the Connection Machine CM-2
1995
We describe three data-parallel implementations of the simplex method for dense linear...
An primal-dual potential reduction algorithm for solving convex quadratic programs
1993
In this paper the authors combine partial updating and an adaptation of Anstreicher's...
Exploiting special structure in a primal-dual path-following algorithm
1993
A primal-dual path-following algorithm that applies directly to a linear program of...
Steepest-edge simplex algorithm for linear programming
1992
The authors present several new steepest-edge simplex algorithms for solving linear...
A primal projective interior point method for linear programming
1991
The authors present a new projective interior point for linear programming with...
On strongly polynomial variants of the network simplex algorithm for the maximum flow problem
1991
The authors give a short proof that the network simplex algorithm with either the...
A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and O(n2m) time
1990
The authors propose a primal network simplex algorithm for solving the maximum flow...
A computational comparison of the Dinic and network simplex methods for maximum flow
1988
The authors study the implementation of two fundamentally different algorithms for...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers