Optimal procedures for dynamic programs with complex loop structures
From MaRDI portal
Publication:1821703
DOI10.1016/0022-247X(86)90159-9zbMath0616.90092MaRDI QIDQ1821703
Chae Y. Lee, Augustine O. Esogbue
Publication date: 1986
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Related Items (3)
Determination of the best main serial chain in nonserial dynamic programming networks ⋮ A high level dynamic programming algorithm for processing nonserial looped systems ⋮ Optimal procedures and complexity analyses of nonserial converging branch networks
Cites Work
- Unnamed Item
- Unnamed Item
- Closed form solutions to nonserial, nonconvex quadratic programming problems using dynamic programming
- Fuzzy dynamic programming, fuzzy adaptive neuro control, and the general medical diagnosis problem
- 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
- A Dynamic Programming Solution to Cost-Time Tradeoff for CPM
- Dynamic Programming Models of the Nonserial Critical Path-Cost Problem
- Non-Serial Dynamic Programming — A Survey
This page was built for publication: Optimal procedures for dynamic programs with complex loop structures