Determination of the best main serial chain in nonserial dynamic programming networks

DOI10.1016/0377-2217(93)90065-UzbMath0771.90094OpenAlexW2076756407MaRDI QIDQ2367369

Chae Y. Lee, Augustine O. Esogbue

Publication date: 25 August 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(93)90065-u

zbMATH Keywords

complexity analysislooped networksnonserial network structures

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39)

Related Items (1)

A high level dynamic programming algorithm for processing nonserial looped systems

Cites Work

• Unnamed Item
• Optimal analysis of large complex water resources conveyance systems via nonserial dynamic programming
• Optimal procedures for dynamic programs with complex loop structures
• Fuzzy dynamic programming, fuzzy adaptive neuro control, and the general medical diagnosis problem
• A high-level computing algorithm for diverging and converging branch nonserial dynamic programming systems

This page was built for publication: Determination of the best main serial chain in nonserial dynamic programming networks