Skip to main content

8 Result(s)

within Michael D. Grigoriadis Remove this filter

and

  1. No Access

    Article

    Network optimization: Algorithms and applications

    Giorgio Gallo, Michael D. Grigoriadis in Mathematical Programming (1997)

  2. No Access

    Chapter and Conference Paper

    Approximate Lagrangian Decomposition with a Modified Karmarkar Logarithmic Potential

    A modified Karmarkar logarithmic potential is used in the framework of unrestricted Lagrangian decomposition to develop a fast approximation scheme for nonnegative convex block angular min-max resource sharing...

    Jorge Villavicencio, Michael D. Grigoriadis in Network Optimization (1997)

  3. No Access

    Article

    Approximate minimum-cost multicommodity flows in \(\tilde O\) (ɛ −2 KNM) timetime

    We show that an ε-approximate solution of the cost-constrainedK-commodity flow problem on anN-nodeM-arc network,G can be computed by sequentially solving O(K(ɛ −2+logGK) logGM log (Gɛ ...

    Michael D. Grigoriadis, Leonid G. Khachiyan in Mathematical Programming (1996)

  4. No Access

    Chapter

    Approximate Structured Optimization by Cyclic Block-Coordinate Descent

    A uniform randomized exponential-potential block-coordinate descent method for the approximate solution of block-angular convex resource-sharing programs was analyzed in [5] and for the linear case in [14]. Th...

    Jorge Villavicencio, Michael D. Grigoriadis in Applied Mathematics and Parallel Computing (1996)

  5. No Access

    Article

    Use of dynamic trees in a network simplex algorithm for the maximum flow problem

    Goldfarb and Hao (1990) have proposed a pivot rule for the primal network simplex algorithm that will solve a maximum flow problem on ann-vertex,m-arc network in at mostnm pivots and O(n 2 m) time. In this paper ...

    Andrew V. Goldberg, Michael D. Grigoriadis, Robert E. Tarjan in Mathematical Programming (1991)

  6. No Access

    Article

    A computational comparison of the dinic and network simplex methods for maximum flow

    We study the implementation of two fundamentally different algorithms for solving the maximum flow problem: Dinic's method and the network simplex method. For the former, we present the design of a storage-eff...

    Donald Goldfarb, Michael D. Grigoriadis in Annals of Operations Research (1988)

  7. No Access

    Chapter

    Numerical methods for basic solutions of generalized flow networks

    A central problem in implementing specializations of the simplex method for solving large minimum-cost generalized network flow problems is the accurate and efficient computation of basic solutions. Bases for ...

    Michael D. Grigoriadis, Tau Hsu in Mathematical Programming at Oberwolfach II (1984)

  8. No Access

    Article

    A projective method for structured nonlinear programs

    This paper describes a partitioning method for solving a class of structured nonlinear programming problems with block diagonal constraints and a few coupling variables.

    Michael D. Grigoriadis in Mathematical Programming (1971)