A Reach and Bound algorithm for acyclic dynamic-programming networks (Q3632964)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Reach and Bound algorithm for acyclic dynamic-programming networks |
scientific article |
Statements
A Reach and Bound algorithm for acyclic dynamic-programming networks (English)
0 references
16 June 2009
0 references
dynamic programming networks
0 references
shortest path problem
0 references
pruning
0 references
0 references
