A high-level computing algorithm for diverging and converging branch nonserial dynamic programming systems
From MaRDI portal
Publication:4726075
DOI10.1016/0898-1221(86)90057-XzbMath0616.90091MaRDI QIDQ4726075
Augustine O. Esogbue, N.A.Warsi
Publication date: 1986
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Related Items (4)
Determination of the best main serial chain in nonserial dynamic programming networks ⋮ A high level dynamic programming algorithm for processing nonserial looped systems ⋮ Optimal analysis of large complex water resources conveyance systems via nonserial dynamic programming ⋮ Computational experiments with a class of dynamic programming algorithms of higher dimensions
Cites Work
- Unnamed Item
- Unnamed Item
- Superposition in branching allocation problems
- A new algorithm for the solution of the secondary optimization problem in non-serial dynamic programming
- Contribution to nonserial dynamic programming
- A theorem in nonserial dynamic programming
- On non-serial dynamic programming
- Dynamic programming, fuzzy sets, and the modeling of R&D management control systems
- Dynamic Programming Models of the Nonserial Critical Path-Cost Problem
- Non-Serial Dynamic Programming — A Survey
- Communications to the Editor—The Status of Nonserial Dynamic Programming
This page was built for publication: A high-level computing algorithm for diverging and converging branch nonserial dynamic programming systems