A distributed algorithm for convex network optimization problems
暂无分享,去创建一个
[1] D. Bertsekas,et al. Distributed asynchronous relaxation methods for convex network flow problems , 1987 .
[2] D. Bertsekas,et al. Relaxation methods for minimum cost network flow problems , 1983 .
[3] D. Bertsekas,et al. Projected Newton methods and optimization of multicommodity flows , 1982, 1982 21st IEEE Conference on Decision and Control.
[4] Michael J. Flynn,et al. Some Computer Organizations and Their Effectiveness , 1972, IEEE Transactions on Computers.
[5] J. A. Ventura,et al. Restricted simplicial decomposition: computation and extensions , 1987 .
[6] J. G. Klincewicz,et al. A scaled reduced gradient algorithm for network flow problems with convex separable costs , 1981 .
[7] John M. Mulvey,et al. Nonlinear programming on generalized networks , 1987, TOMS.
[8] Leon S. Lasdon,et al. Feature Article - Survey of Nonlinear Programming Applications , 1980, Oper. Res..
[9] S. Zenios,et al. Relaxation techniques for strictly convex network problems , 1986 .
[10] S A Zenios. SEQUENTIAL AND PARALLEL ALGORITHMS FOR CONVEX GENERALIZED NETWORK PROBLEMS AND RELATED APPLICATIONS , 1986 .
[11] David G. Luenberger,et al. Linear and nonlinear programming , 1984 .
[12] Nicos Christofides,et al. An Algorithm for the Chromatic Number of a Graph , 1971, Comput. J..
[13] Trond Steihaug,et al. Truncated-newtono algorithms for large-scale unconstrained optimization , 1983, Math. Program..
[14] Garrett Birkhoff,et al. Non-linear network problems , 1956 .
[15] Daniel Gajski,et al. Essential Issues in Multiprocessor Systems , 1985, Computer.