scientific article; zbMATH DE number 4033460

MaRDI QIDQ3773672zbMATH OpenFDO

Authors Chae Y. Lee

Publication date 1987

zbMATH Keywords

complexity of the networknonserial diverging branch systems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Dynamic programming (90C39)

Recommendations

• A high-level computing algorithm for diverging and converging branch nonserial dynamic programming systems
• Optimal procedures and complexity analyses of nonserial converging branch networks
• Extension of dynamic programming to nonseparable dynamic optimization problems
• Nonserial Dynamic Programming and Tree Decomposition in Discrete Optimization
• Postoptimal Analysis in Nonserial Dynamic Programming
• Approximating closed form solutions to converging branch dynamic programming problems
• Efficient application of nonserial dynamic programming in combinatorial optimization
• A class of nonseparable dynamic programming problems
• New approach for nonseparable dynamic programming problems

Cited in

(4)

• Optimal procedures for dynamic programs with complex loop structures
• A high-level computing algorithm for diverging and converging branch nonserial dynamic programming systems
• A Non-Serial Dynamic Programming Model with an Application to the Optimal Design of Distribution Networks
• Optimal procedures and complexity analyses of nonserial converging branch networks

This page was built for publication:

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