The following pages link to Michael D. Grigoriadis (Q1176565):
Displaying 22 items.
- (Q1072707) (redirect page) (← links)
- A lower bound to the complexity of Euclidean and rectilinear matching algorithms (Q1072708) (← links)
- Use of dynamic trees in a network simplex algorithm for the maximum flow problem (Q1176566) (← links)
- Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time (Q1363422) (← links)
- A sublinear-time randomized approximation algorithm for matrix games (Q1919166) (← links)
- Approximate Max-Min Resource Sharing for Structured Concave Optimization (Q2719242) (← links)
- Numerical methods for basic solutions of generalized flow networks (Q3220317) (← links)
- An efficient implementation of the network simplex method (Q3725834) (← links)
- A new class of heuristic algorithms for weighted perfect matching (Q3813310) (← links)
- (Q4215386) (← links)
- Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints (Q4294745) (← links)
- (Q4323609) (← links)
- (Q4363183) (← links)
- An Interior Point Method for Bordered Block-Diagonal Linear Programs (Q4717549) (← links)
- A Fast Algorithm for Trummer’s Problem (Q4728104) (← links)
- A Fast Parametric Maximum Flow Algorithm and Applications (Q4729349) (← links)
- An exponential‐function reduction method for block‐angular convex programs (Q4894869) (← links)
- Coordination Complexity of Parallel Price-Directive Decomposition (Q4895561) (← links)
- A Treatment of Transportation Problems by Primal Partition Programming (Q5550292) (← links)
- A Dual Generalized Upper Bounding Technique (Q5619720) (← links)
- A projective method for structured nonlinear programs (Q5668258) (← links)
- A partitioning algorithm for the multicommodity network flow problem (Q5668269) (← links)
