Michael D. Grigoriadis

According to our database1, Michael D. Grigoriadis authored at least 15 papers between 1969 and 2001.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2001
Approximate Max-Min Resource Sharing for Structured Concave Optimization.
SIAM J. Optim., 2001

1996
An Interior Point Method for Bordered Block-Diagonal Linear Programs.
SIAM J. Optim., 1996

Approximate minimum-cost multicommodity flows in Õ(epsilon<sup>-2</sup>KNM) time.
Math. Program., 1996

Coordination Complexity of Parallel Price-Directive Decomposition.
Math. Oper. Res., 1996

1995
A sublinear-time randomized approximation algorithm for matrix games.
Oper. Res. Lett., 1995

An exponential-function reduction method for block-angular convex programs.
Networks, 1995

1994
Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints.
SIAM J. Optim., 1994

1991
Use of dynamic trees in a network simplex algorithm for the maximum flow problem.
Math. Program., 1991

1989
A Fast Parametric Maximum Flow Algorithm and Applications.
SIAM J. Comput., 1989

1988
A new class of heuristic algorithms for weighted perfect matching.
J. ACM, 1988

1986
A Lower Bound to the Complexity of Euclidean and Rectilinear Matching Algorithms.
Inf. Process. Lett., 1986

1972
A partitioning algorithm for the multicommodity network flow problem.
Math. Program., 1972

1971
A projective method for structured nonlinear programs.
Math. Program., 1971

Experimental implementations of mixed integer programming algorithms.
Proceedings of the 26th ACM annual conference, 1971

1969
A Decomposition Method for Structured Linear and Nonlinear Programs.
J. Comput. Syst. Sci., 1969


  Loading...