The concept of state in discrete dynamic programming
From MaRDI portal
Publication:2538061
DOI10.1016/0022-247X(70)90066-1zbMath0191.49201OpenAlexW2092614653MaRDI QIDQ2538061
Publication date: 1970
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-247x(70)90066-1
Related Items
A Dimension-Reduction Algorithm for Multi-Stage Decision Problems with Returns in a Partially Ordered Set, A Dynamic Programming Approach to the Dominating Set Problem on k-Trees, Some comments on preference order dynamic programming models, Algorithms for the decomposition of a polygon into convex polygons, Classes of discrete optimization problems and their decision problems, A practical algorithm for decomposing polygonal domains into convex polygons by diagonals, Solvable classes of discrete dynamic programming, Monotonicity and the principle of optimality, Polynomial-time instances of the minimum weight triangulation problem
Cites Work
- Composition Principles for Synthesis of Optimal Multistage Processes
- On the Iterative Method of Dynamic Programming on a Finite Space Discrete Time Markov Process
- Scheduling to Minimize Interaction Cost
- Finite-State Processes and Dynamic Programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item