Optimal procedures and complexity analyses of nonserial converging branch networks

DOI10.1016/0377-2217(89)90232-4MaRDI QIDQ918445zbMATHOpenAlexFDO

Authors 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) Dynamic programming (90C39) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• scientific article; zbMATH DE number 4033460
• Complexity and algorithms for convex network optimization and other nonlinear problems
• Approximating optimum branchings in linear time
• Branching Processes, the Max-Plus Algebra and Network Calculus
• Branch and cut methods for network optimization
• scientific article; zbMATH DE number 1041832
• scientific article; zbMATH DE number 4020868
• Bounds to Complexities of Networks for Sorting and for Switching
• On the complexity of designing optimal branch-and-combine clock networks

Cites work

• scientific article; zbMATH DE number 4033460 (Why is no real title available?)
• Non-Serial Dynamic Programming — A Survey
• 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

Cited in

(5)

• A high-level computing algorithm for diverging and converging branch nonserial dynamic programming systems
• On the complexity of designing optimal branch-and-combine clock networks
• Three recursive approaches for decision processes with a converging branch system
• Optimal procedures for dynamic programs with complex loop structures
• scientific article; zbMATH DE number 4033460 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q918445)