Piecewise-linear approximation methods for nonseparable convex optimization
暂无分享,去创建一个
[1] Peter A. Steenbrink,et al. Optimization of Transport Networks , 1974 .
[2] Fred W. Glover,et al. Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems , 1974, Networks.
[3] Maurice Snowdon,et al. Network Flow Programming , 1980 .
[4] R. Meyer,et al. Secant approximation methods for convex optimization , 1981 .
[5] Robert R. Meyer,et al. Computational aspects of two-segment separable programming , 1983, Math. Program..
[6] Michael A. Saunders,et al. MINOS 5. 0 user's guide , 1983 .
[7] Sidney L. Hantler,et al. An Algorithm for Optimal Route Selection in SNA Networks , 1983, IEEE Trans. Commun..
[8] Pasumarti V. Kamesam,et al. Multipoint methods for separable nonlinear networks , 1984 .
[9] David G. Luenberger,et al. Linear and nonlinear programming , 1984 .
[10] Jong-Shi Pang,et al. Linearized simplicial decomposition methods for computing traffic equilibria on networks , 1984, Networks.
[11] David J. DeWitt,et al. The Crystal Multicomputer: Design and Implementation Experience , 1987, IEEE Transactions on Software Engineering.