Solvable classes of discrete dynamic programming

DOI10.1016/0022-247X(73)90283-7zbMath0269.49038OpenAlexW2094579526MaRDI QIDQ2563309

Toshihide Ibaraki

Publication date: 1973

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(73)90283-7

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80) Hamilton-Jacobi theories (49L99) Algorithms in computer science (68W99)

Related Items

The principle of optimality in the design of efficient algorithms ⋮ Discrete Decision Process Model Involves Greedy Algorithm over Greedoid ⋮ Systolic processing for dynamic programming problems ⋮ A general heuristic bottom-up procedure for searching AND/OR graphs ⋮ Dynamic programming is optimal for certain sequential decision processes ⋮ Classes of discrete optimization problems and their decision problems ⋮ On the optimality of algorithms for finite state sequential decision processes ⋮ Monotonicity and the principle of optimality ⋮ The application of automated reasoning to formal models of combinatorial optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Classes of discrete optimization problems and their decision problems
• The concept of state in discrete dynamic programming
• On a routing problem
• Minimal representations of some classes of dynamic programming
• Composition Principles for Synthesis of Optimal Multistage Processes
• A Survey of Regular Expressions and Their Applications
• Scheduling to Minimize Interaction Cost
• Contraction Mappings in the Theory Underlying Dynamic Programming
• Finite-State Processes and Dynamic Programming
• An Appraisal of Some Shortest-Path Algorithms
• Necessary and Sufficient Conditions for Dynamic Programming of Combinatorial Type
• Decision-Making in a Fuzzy Environment
• Derivatives of Regular Expressions
• Representation theorems for equivalent optimization problems