A Comprehensive Model of Dynamic Programming

DOI10.1137/0606032zbMath0564.90041OpenAlexW2064383412MaRDI QIDQ3678966

Paul Helman, Arnon Rosenthal

Publication date: 1985

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0606032

zbMATH Keywords

comparabilitydiscrete dynamic programming

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Dynamic programming in optimal control and differential games (49L20) Formal languages and automata (68Q45) Dynamic programming (90C39)

Related Items (6)

The principle of optimality in the design of efficient algorithms ⋮ Categories, relations and dynamic programming ⋮ Toward a model for backtracking and dynamic programming ⋮ Dynamic programming with convexity, concavity and sparsity ⋮ Limitations of incremental dynamic programming ⋮ A stronger model of dynamic programming algorithms

Cites Work

• Nonserial dynamic programming
• Dynamic Programming as Graph Searching: An Algebraic Approach
• Dynamic Programming is Optimal for Nonserial Optimization Problems
• Minimal representations of some classes of dynamic programming
• Finite-State Processes and Dynamic Programming
• Necessary and Sufficient Conditions for Dynamic Programming of Combinatorial Type
• Unnamed Item
• Unnamed Item

This page was built for publication: A Comprehensive Model of Dynamic Programming