Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Michael D. Grigoriadis
Information about the author Michael D. Grigoriadis will soon be added to the site.
Found
5 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Approximate minimum-cost multicommodity flows in Õ (ϵ–2KNM) time
1996
We show that an ϵ-approximate solution of the cost-constrained K -commodity flow...
A sublinear-time randomized approximation algorithm for matrix games
1995
This paper presents a parallel randomized algorithm which computes a pair of •-...
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...
As fast parametric maximum flow algorithm and applications
1989
The classical maximum flow problem sometimes occurs in settings in which the arc...
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