Michael D. Grigoriadis

Available identifiers

zbMath Open grigoriadis.michael-dWikidataQ102266053 ScholiaQ102266053MaRDI QIDQ1176565

List of research outcomes

Publication	Date of Publication	Type
Approximate Max-Min Resource Sharing for Structured Concave Optimization	2001-06-21	Paper
https://portal.mardi4nfdi.de/entity/Q4215386	1998-10-26	Paper
https://portal.mardi4nfdi.de/entity/Q4363183	1998-01-05	Paper
Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time	1997-11-11	Paper
An Interior Point Method for Bordered Block-Diagonal Linear Programs	1997-08-18	Paper
A sublinear-time randomized approximation algorithm for matrix games	1997-03-11	Paper
Coordination Complexity of Parallel Price-Directive Decomposition	1997-03-11	Paper
An exponential‐function reduction method for block‐angular convex programs	1996-10-07	Paper
https://portal.mardi4nfdi.de/entity/Q4323609	1995-02-23	Paper
Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints	1994-05-18	Paper
Use of dynamic trees in a network simplex algorithm for the maximum flow problem	1992-06-25	Paper
A Fast Parametric Maximum Flow Algorithm and Applications	1989-01-01	Paper
A new class of heuristic algorithms for weighted perfect matching	1988-01-01	Paper
A Fast Algorithm for Trummer’s Problem	1987-01-01	Paper
A lower bound to the complexity of Euclidean and rectilinear matching algorithms	1986-01-01	Paper
An efficient implementation of the network simplex method	1986-01-01	Paper
Numerical methods for basic solutions of generalized flow networks	1984-01-01	Paper
A partitioning algorithm for the multicommodity network flow problem	1972-01-01	Paper
A Dual Generalized Upper Bounding Technique	1971-01-01	Paper
A projective method for structured nonlinear programs	1971-01-01	Paper
A Treatment of Transportation Problems by Primal Partition Programming	1968-01-01	Paper

Research outcomes over time

This page was built for person: Michael D. Grigoriadis