The concept of state in discrete dynamic programming

DOI10.1016/0022-247X(70)90066-1MaRDI QIDQ2538061zbMATH OpenOpenAlexFDO

Authors Salah E. Elmaghraby

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

zbMATH Keywords

operations research

Cites work

• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 5345413 (Why is no real title available?)
• scientific article; zbMATH DE number 3231732 (Why is no real title available?)
• scientific article; zbMATH DE number 3285130 (Why is no real title available?)
• scientific article; zbMATH DE number 3301979 (Why is no real title available?)
• Composition Principles for Synthesis of Optimal Multistage Processes
• Finite-State Processes and Dynamic Programming
• On the Iterative Method of Dynamic Programming on a Finite Space Discrete Time Markov Process
• Scheduling to Minimize Interaction Cost

Cited in

(9)

• Monotonicity and the principle of optimality
• Algorithms for the decomposition of a polygon into convex polygons
• A Dimension-Reduction Algorithm for Multi-Stage Decision Problems with Returns in a Partially Ordered Set
• 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
• Some comments on preference order dynamic programming models
• Polynomial-time instances of the minimum weight triangulation problem
• A Dynamic Programming Approach to the Dominating Set Problem on k-Trees

This page was built for publication: The concept of state in discrete dynamic programming

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