Non-Serial Dynamic Programming — A Survey

DOI10.1057/JORS.1974.43MaRDI QIDQ4765656zbMATH OpenOpenAlexFDO

Authors Augustine O. Esogbue, Barry Randall Marks

Publication date 1974

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/jors.1974.43

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to calculus of variations and optimal control (49-02) Hamilton-Jacobi theories (49L99)

Cited in

(5)

• Optimal procedures for dynamic programs with complex loop structures
• Sufficient and necessary conditions for solution finding in valuation-based systems
• A high-level computing algorithm for diverging and converging branch nonserial dynamic programming systems
• Any-k algorithms for enumerating ranked answers to conjunctive queries
• Optimal procedures and complexity analyses of nonserial converging branch networks

This page was built for publication: Non-Serial Dynamic Programming — A Survey

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