A Comprehensive Model of Dynamic Programming
From MaRDI portal
Recommendations
Cites work
- Dynamic Programming as Graph Searching: An Algebraic Approach
- Dynamic Programming is Optimal for Nonserial Optimization Problems
- Finite-State Processes and Dynamic Programming
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 3690676 (Why is no real title available?)
- Minimal representations of some classes of dynamic programming
- Necessary and Sufficient Conditions for Dynamic Programming of Combinatorial Type
- Nonserial dynamic programming
Cited in
(18)- The principle of optimality in the design of efficient algorithms
- On a language for discrete dynamic programming and a microcomputer implementation
- Dynamic programming with convexity, concavity and sparsity
- Modeling dynamic programming problems over sequences and trees with inverse coupled rewrite systems
- The principle and models of dynamic programming. IV
- The principle and models of dynamic programming. III
- Incremental versus non-incremental dynamic programming
- scientific article; zbMATH DE number 1615269 (Why is no real title available?)
- Modelling dynamic programming problems by generalized d-graphs
- Polyhedral Characterization of Discrete Dynamic Programming
- Postoptimal Analysis in Nonserial Dynamic Programming
- scientific article; zbMATH DE number 3912138 (Why is no real title available?)
- A common schema for dynamic programming and branch and bound algorithms
- Categories, relations and dynamic programming
- Toward a model for backtracking and dynamic programming
- Limitations of incremental dynamic programming
- A stronger model of dynamic programming algorithms
- Polymorphic dynamic programming by algebraic shortcut fusion
This page was built for publication: A Comprehensive Model of Dynamic Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3678966)