Solvable classes of discrete dynamic programming

DOI10.1016/0022-247X(73)90283-7MaRDI QIDQ2563309zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• A note on two problems in connexion with graphs
• A Survey of Regular Expressions and Their Applications
• An Appraisal of Some Shortest-Path Algorithms
• Classes of discrete optimization problems and their decision problems
• Composition Principles for Synthesis of Optimal Multistage Processes
• Contraction Mappings in the Theory Underlying Dynamic Programming
• Decision-Making in a Fuzzy Environment
• Derivatives of Regular Expressions
• Finite-State Processes and Dynamic Programming
• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 3131080 (Why is no real title available?)
• scientific article; zbMATH DE number 3983152 (Why is no real title available?)
• scientific article; zbMATH DE number 3251424 (Why is no real title available?)
• scientific article; zbMATH DE number 3254905 (Why is no real title available?)
• scientific article; zbMATH DE number 3264081 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• scientific article; zbMATH DE number 3313249 (Why is no real title available?)
• Minimal representations of some classes of dynamic programming
• Necessary and Sufficient Conditions for Dynamic Programming of Combinatorial Type
• On a routing problem
• Representation theorems for equivalent optimization problems
• Scheduling to Minimize Interaction Cost
• The concept of state in discrete dynamic programming

Cited in

(10)

• The principle of optimality in the design of efficient algorithms
• Systolic processing for dynamic programming problems
• Dynamic programming is optimal for certain sequential decision processes
• 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
• Classes of discrete optimization problems and their decision problems
• A general heuristic bottom-up procedure for searching AND/OR graphs
• Discrete Decision Process Model Involves Greedy Algorithm over Greedoid
• Domain-independent dynamic programming

This page was built for publication: Solvable classes of discrete dynamic programming

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