Dynamic Programming Models of the Nonserial Critical Path-Cost Problem
From MaRDI portal
Publication:4162948
DOI10.1287/MNSC.24.2.200zbMath0383.90060OpenAlexW2154016082MaRDI QIDQ4162948
Augustine O. Esogbue, Barry Randall Marks
Publication date: 1977
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.24.2.200
Applications of mathematical programming (90C90) Dynamic programming (90C39) Operations research and management science (90B99)
Related Items (3)
Optimal procedures for dynamic programs with complex loop structures ⋮ A high-level computing algorithm for diverging and converging branch nonserial dynamic programming systems ⋮ Improving project cost estimation by taking into account managerial flexibility
This page was built for publication: Dynamic Programming Models of the Nonserial Critical Path-Cost Problem