Distributed Asynchronous Relaxation Methods for Linear Network Flow Problems

[1]  Ravindra K. Ahuja,et al.  A Fast and Simple Algorithm for the Maximum Flow Problem , 2011, Oper. Res..

[2]  D. Bertsekas.  The auction algorithm: A distributed relaxation method for the assignment problem , 1988 .

[3]  Paul Tseng,et al.  Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems , 1988, Oper. Res..

[4]  D. Bertsekas,et al.  Relaxation methods for network flow problems with convex arc costs , 1987 .

[5]  Andrew Vladislav Goldberg,et al.  Efficient graph algorithms for sequential and parallel computers , 1987 .

[6]  Andrew V. Goldberg,et al.  Solving minimum-cost flow problems by successive approximation , 1987, STOC.

[7]  D. Bertsekas,et al.  Distributed asynchronous relaxation methods for convex network flow problems , 1987 .

[8]  D. Bertsekas.  Distributed relaxation methods for linear network flow problems , 1986, 1986 25th IEEE Conference on Decision and Control.

[9]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[10]  J. Orlin.  Working Paper Alfred P. Sloan School of Management Genuinely Polynominal Simplex and Non-simplex Algorithms for the Minimum Cost Flow Problem Genuinely Polynominal Simplex and Non-simplex Algorithms for the Minimum Cost Flow Problem , 2008 .

[11]  D. Bertsekas.  A distributed asynchronous relaxation algorithm for the assignment problem , 1985, 1985 24th IEEE Conference on Decision and Control.

[12]  Baruch Awerbuch,et al.  Complexity of network synchronization , 1985, JACM.

[13]  Éva Tardos,et al.  A strongly polynomial minimum cost circulation algorithm , 1985, Comb..

[14]  Dimitri P. Bertsekas,et al.  A unified framework for primal-dual methods in minimum cost network flow problems , 1985, Math. Program..

[15]  Dimitri P. Bertsekas,et al.  Distributed asynchronous computation of fixed points , 1983, Math. Program..

[16]  Edsger W. Dijkstra,et al.  Termination Detection for Diffusing Computations , 1980, Inf. Process. Lett..

[17]  D. Bertsekas,et al.  A DESCENT NUMERICAL METHOD FOR OPTIMIZATION PROBLEMS WITH NONDIFFERENTIABLE COST FUNCTIONALS , 1973 .

[18]  Boris Polyak.  Minimization of unsmooth functionals , 1969 .