Dual Coordinate Ascent Methods for Linear Network Flow Problems
暂无分享,去创建一个
[1] D. Bertsekas,et al. A Distributed Algorithm for the Assignment Problem , 2022 .
[2] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.
[3] Andrew V. Goldberg,et al. Finding minimum-cost flows by double scaling , 2015, Math. Program..
[4] David L. Jensen,et al. On the computational behavior of a polynomial-time network flow algorithm , 1992, Math. Program..
[5] Robert E. Tarjan,et al. Faster scaling algorithms for general graph matching problems , 1991, JACM.
[6] Ravindra K. Ahuja,et al. A Fast and Simple Algorithm for the Maximum Flow Problem , 2011, Oper. Res..
[7] Robert E. Tarjan,et al. Faster Scaling Algorithms for Network Problems , 1989, SIAM J. Comput..
[8] D. Bertsekas. The auction algorithm: A distributed relaxation method for the assignment problem , 1988 .
[9] Stavros A. Zenios,et al. Nonlinear network optimization on a massively parallel connection machine , 1988 .
[10] Paul Tseng,et al. Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems , 1988, Oper. Res..
[11] D. Bertsekas,et al. Relaxation methods for network flow problems with convex arc costs , 1987 .
[12] Dimitri P. Bertsekas,et al. Distributed Asynchronous Relaxation Methods for Linear Network Flow Problems , 1987 .
[13] Andrew Vladislav Goldberg,et al. Efficient graph algorithms for sequential and parallel computers , 1987 .
[14] Andrew V. Goldberg,et al. Solving minimum-cost flow problems by successive approximation , 1987, STOC.
[15] D. Bertsekas,et al. Distributed asynchronous relaxation methods for convex network flow problems , 1987 .
[16] D. Bertsekas. Distributed relaxation methods for linear network flow problems , 1986, 1986 25th IEEE Conference on Decision and Control.
[17] Andrew V. Goldberg,et al. A new approach to the maximum flow problem , 1986, STOC '86.
[18] Paul Tseng,et al. Relaxation methods for monotropic programming problems , 1986 .
[19] 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 .
[20] D. Bertsekas. A distributed asynchronous relaxation algorithm for the assignment problem , 1985, 1985 24th IEEE Conference on Decision and Control.
[21] Baruch Awerbuch,et al. Complexity of network synchronization , 1985, JACM.
[22] Éva Tardos,et al. A strongly polynomial minimum cost circulation algorithm , 1985, Comb..
[23] Dimitri P. Bertsekas,et al. A unified framework for primal-dual methods in minimum cost network flow problems , 1985, Math. Program..
[24] Azuma Ohuchi,et al. Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costs , 1984, Networks.
[25] Dimitri P. Bertsekas,et al. Distributed asynchronous computation of fixed points , 1983, Math. Program..
[26] R. Cottle,et al. On the convergence of a block successive over-relaxation method for a class of linear complementarity problems , 1982 .
[27] Y. Censor,et al. An iterative row-action method for interval convex programming , 1981 .
[28] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[29] Edsger W. Dijkstra,et al. Termination Detection for Diffusing Computations , 1980, Inf. Process. Lett..
[30] T. Stern,et al. A Class of Decentralized Routing Algorithms Using Relaxation , 1977, IEEE Trans. Commun..
[31] D. Klingman,et al. NETGEN - A Program for Generating Large Scale (Un) Capacitated Assignment, Transportation, and Minim , 1974 .
[32] D. Bertsekas,et al. A DESCENT NUMERICAL METHOD FOR OPTIMIZATION PROBLEMS WITH NONDIFFERENTIABLE COST FUNCTIONALS , 1973 .
[33] Boris Polyak. Minimization of unsmooth functionals , 1969 .