Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Michael D. Grigoriadis
2000 – 2009
- 2001
[j8]Michael D. Grigoriadis, Leonid G. Khachiyan, Lorant Porkolab, J. Villavicencio: Approximate Max-Min Resource Sharing for Structured Concave Optimization. SIAM Journal on Optimization 11(4): 1081-1091 (2001)
1990 – 1999
- 1996
- [j7]Michael D. Grigoriadis, Leonid G. Khachiyan: Approximate minimum-cost multicommodity flows in Õ(epsilon-2KNM) time. Math. Program. 75: 477-482 (1996)
- 1995
- [j6]Michael D. Grigoriadis, Leonid G. Khachiyan: An exponential-function reduction method for block-angular convex programs. Networks 26(2): 59-68 (1995)
- 1991
- [j5]Andrew V. Goldberg, Michael D. Grigoriadis, Robert Endre Tarjan: Use of dynamic trees in a network simplex algorithm for the maximum flow problem. Math. Program. 50: 277-290 (1991)
1980 – 1989
- 1989
- [j4]Giorgio Gallo, Michael D. Grigoriadis, Robert Endre Tarjan: A Fast Parametric Maximum Flow Algorithm and Applications. SIAM J. Comput. 18(1): 30-55 (1989)
- 1988
- [j3]Michael D. Grigoriadis, B. Kalantari: A new class of heuristic algorithms for weighted perfect matching. J. ACM 35(4): 769-776 (1988)
- 1986
- [j2]Michael D. Grigoriadis, B. Kalantari: A Lower Bound to the Complexity of Euclidean and Rectilinear Matching Algorithms. Inf. Process. Lett. 22(2): 73-76 (1986)
1960 – 1969
- 1969
- [j1]Michael D. Grigoriadis, Klaus Ritter: A Decomposition Method for Structured Linear and Nonlinear Programs. J. Comput. Syst. Sci. 3(4): 335-360 (1969)
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 20:30 CET by the dblp team