Optimal procedures and complexity analyses of nonserial converging branch networks

DOI10.1016/0377-2217(89)90232-4zbMath0705.90093OpenAlexW2070302802MaRDI QIDQ918445

Chae Y. Lee

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0377-2217(89)90232-4

zbMATH Keywords

dimensional reductionnonserial converging branch networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Dynamic programming (90C39) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

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
• Superposition in branching allocation problems
• Non-Serial Dynamic Programming — A Survey

This page was built for publication: Optimal procedures and complexity analyses of nonserial converging branch networks