论文信息 - Parametrization in nonserial dynamic programming

Parametrization in nonserial dynamic programming

— New developments in the theory of nonserial dynamic programming art described in this paper, The new, more gênerai, décomposition technique which uses parametrization allows, in gênerai, solving the given optimization problem with less computationi effort. Also interesting connections with graph theory are pointed out.

Umberto Bertelè | Francesco Brioschi | U. Bertelè | F. Brioschi

[1] Umberto Bertelè,et al. Contribution to nonserial dynamic programming , 1969 .

[2] F. Harary,et al. The theory of graphs and its applications , 1963 .

[3] U. Bertelè,et al. A new algorithm for the solution of the secondary optimization problem in non-serial dynamic programming , 1969 .

[4] Umberto Bertelè,et al. A theorem in nonserial dynamic programming , 1970 .

[5] George L. Nemhauser,et al. Introduction To Dynamic Programming , 1966 .

[6] Shimon Even,et al. Minimizing the Number of Operations in Certain Discrete-Variable Optimization Problems , 1970, Oper. Res..

[7] Rutherford Aris,et al. Optimization of multistage cyclic and braching systems by serial procedures , 1964 .

[8] Samuel J. Mason,et al. Feedback Theory-Some Properties of Signal Flow Graphs , 1953, Proceedings of the IRE.