Optimal dynamic routing in communication networks with continuous traffic
暂无分享,去创建一个
[1] Adrian Segall,et al. Open-Loop Solutions for the Dynamic Routing Problem, , 1980 .
[2] P. Nash,et al. A Class of Continuous Network Flow Problems , 1982, Math. Oper. Res..
[3] E. Polak. Introduction to linear and nonlinear programming , 1973 .
[4] D. Bertsekas. Projected Newton methods for optimization problems with simple constraints , 1981, CDC 1981.
[5] Adrian Segall,et al. Optimal Distributed Routing for Virtual Line-Switched Data Networks , 1979, IEEE Trans. Commun..
[6] A. Goldstein. Convex programming in Hilbert space , 1964 .
[7] A. Segall,et al. An optimal control approach to dynamic routing in networks , 1982 .
[8] Adrian Segall,et al. A maximal flow approach to dynamic routing in communication networks , 1980 .
[9] Adrian Segall,et al. The Modeling of Adaptive Routing in Data-Communication Networks , 1977, IEEE Trans. Commun..
[10] D. R. Fulkerson,et al. Flows in Networks. , 1964 .
[11] S. N. Maheshwari,et al. An O(|V|³) Algorithm for Finding Maximum Flows in Networks , 1978, Inf. Process. Lett..
[12] Greg Knowles,et al. An Introduction to Applied Optimal Control , 1982 .