𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A bound dynamic programming for solving reliability redundancy optimization

✍ Scribed by Li Jianping

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
387 KB
Volume
36
Category
Article
ISSN
0026-2714

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Reach and Bound algorithm for acyclic
A Reach and Bound algorithm for acyclic dynamic-programming networks
✍ Matthew D. Bailey; Robert L. Smith; Jeffrey M. Alden πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 111 KB

## Abstract 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 not to lie on an optimal path. We introduce an Ρ‐pruning condition that extends pr