Dynamic Programming Algorithms and Analyses for Nonserial Networks. Part I.

摘要

This report discusses the research conducted by the research team at the Georgia Institute of Technology in the area of nonserial dynamic programming networks. The problems, approach and major results are summarized in Chapter 1, while the rest of the chapters discuss, in detail, the algorithm developments, experiment with sample problems, and algorithmic complexities. Each chapter contains detailed computer flow charts for the algorithms developed/ Chapter 6 employs an efficient dimensionality reduction algorithms known as the imbedded state space method in conjunction with the one developed in this study to treat an otherwise intractable problem involving feedforward loop systems . These algorithms are useful inputs to the development of dynamic programming based strategies for the analysis of complex nonserial networks.