Minimal representations of some classes of dynamic programming
- 30 April 1975
- journal article
- Published by Elsevier in Information and Control
- Vol. 27 (4) , 289-328
- https://doi.org/10.1016/s0019-9958(75)90151-5
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Classes of discrete optimization problems and their decision problemsJournal of Computer and System Sciences, 1974
- Finite State Representations of Discrete Optimization ProblemsSIAM Journal on Computing, 1973
- Solvable classes of discrete dynamic programmingJournal of Mathematical Analysis and Applications, 1973
- Representation theorems for equivalent optimization problemsInformation and Control, 1972
- The concept of “state” in discrete dynamic programmingJournal of Mathematical Analysis and Applications, 1970
- Finite-State Processes and Dynamic ProgrammingSIAM Journal on Applied Mathematics, 1967
- Contraction Mappings in the Theory Underlying Dynamic ProgrammingSIAM Review, 1967
- Composition Principles for Synthesis of Optimal Multistage ProcessesOperations Research, 1964
- Finite Automata and Their Decision ProblemsIBM Journal of Research and Development, 1959