A Reach and Bound algorithm for acyclic dynamic-programming networks

Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network when they are determined to not lie on an optimal path. We introduce an -pruning condition that extends pruning to include a possible error in the pruning step. This results in a greater reduction of the computation time; however, This work was supported in part by a National Science Foundation GOALI (DMI-9900267) and a grant from General Motors 1 

• Type: Journal
• Year: 2008
• Where: NETWORKS
• Authors: Matthew D. Bailey, Robert L. Smith, Jeffrey M. Alden
• Keywords: Computer Networks, Dynamic Programming Network, NETWORKS 2008, Pruning, Pruning Step