Goldberg Andrew V.

Andrew V. Goldberg

Information about the author Andrew V. Goldberg will soon be added to the site.
Found 8 papers in total
Shortest paths algorithms: Theory and experimental evaluation
Shortest paths algorithms: Theory and experimental evaluation
1996
The authors conduct an extensive computational study of shortest paths algorithms,...
An efficient cost scaling algorithm for the assignment problem
An efficient cost scaling algorithm for the assignment problem
1995
The cost scaling push-relabel method has been shown to be efficient for solving...
Use of dynamic trees in a network simplex algorithm for the maximum flow problem
Use of dynamic trees in a network simplex algorithm for the maximum flow problem
1991
Goldfarb and Hao have proposed a pivot rule for the primal network simplex algorithm...
Finding minimum-cost flows by double scaling
Finding minimum-cost flows by double scaling
1992
Several researchers have recently developed new techniques that give fast algorithms...
Combinatorial algorithms for the generalized circulation problem
Combinatorial algorithms for the generalized circulation problem
1991
The authors consider a generalization of the maximum flow problem in which the amounts...
Finding minimum-cost circulations by successive approximation
Finding minimum-cost circulations by successive approximation
1990
The authors develop a new approach to solving minimum-cost circulation problems. The...
A parallel algorithm for finding a blocking flow in an acyclic network
A parallel algorithm for finding a blocking flow in an acyclic network
1989
The authors propose a simple parallel algorithm for finding a blocking flow in an...
A new approach to the maximum-flow problem
A new approach to the maximum-flow problem
1988
All previously known efficient maximum-flow algorithms work by finding augmenting...
Papers per page: