Optimal procedures and complexity analyses of nonserial converging branch networks (Q918445)

This paper develops optimization procedures that reduce the dimensionality of nonserial converging branch networks in dynamic programming. The author analyzes the time and space complexity of a single converging branch system and compares his results with that of two other methods. By identifying the levels of branches he develops an efficient algorithm for the multi-converging branch network. On the basis of a complexity analysis he determines the best main serial chain.