Decomposition of mathematical programming problems by dynamic programming and its application to block-diagonal geometric programs
暂无分享,去创建一个
[1] George B. Dantzig,et al. Decomposition Principle for Linear Programs , 1960 .
[2] Stuart E. Dreyfus,et al. Applied Dynamic Programming , 1965 .
[3] George L. Nemhauser,et al. Decomposition of linear programs by dynamic programming , 1964 .
[4] L. G. Mitten. Composition Principles for Synthesis of Optimal Multistage Processes , 1964 .
[5] R. P. Harvey. The decomposition principle for linear programs , 1964 .
[6] R. J. Clasen. THE NUMERICAL SOLUTION OF THE CHEMICAL EQUILIBRIUM PROBLEM , 1965 .
[7] George L. Nemhauser,et al. Introduction To Dynamic Programming , 1966 .
[8] Pravin Varaiya,et al. Decomposition of Large-Scale Systems , 1966 .
[9] R. Bellman. Dynamic programming. , 1957, Science.
[10] U. Passy,et al. Generalized Polynomial Optimization , 1967 .
[11] Wladyslaw Findeisen,et al. Parametric Optimization by Primal Method in Multilevel Systems , 1968, IEEE Trans. Syst. Sci. Cybern..
[12] P. A. Gilmore,et al. Structuring of Parallel Algorithms , 1968, JACM.
[13] Leon S. Lasdon,et al. Duality and Decomposition in Mathematical Programming , 1968, IEEE Trans. Syst. Sci. Cybern..
[14] F. Bessière,et al. Optimization and Suboptimization: The Method of Extended Models in the Non-Linear Case , 1968 .
[15] Paul Van Moeseke,et al. Decentralization in Separable Programming , 1969 .
[16] J. E. Falk,et al. An Algorithm for Separable Nonconvex Programming Problems , 1969 .