Dynamic Programming as Graph Searching: An Algebraic Approach
- 1 October 1981
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 28 (4) , 737-751
- https://doi.org/10.1145/322276.322285
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Optimizing decision trees through heuristically guided searchCommunications of the ACM, 1978
- A generalization of Dijkstra's algorithmInformation Processing Letters, 1977
- Non deterministic recursive program schemesLecture Notes in Computer Science, 1977
- Initial Algebra Semantics and Continuous AlgebrasJournal of the ACM, 1977
- On the optimality of algorithms for finite state sequential decision processesJournal of Mathematical Analysis and Applications, 1976
- On the Foundations of Dynamic ProgrammingPublished by Springer Nature ,1975
- Classes of discrete optimization problems and their decision problemsJournal of Computer and System Sciences, 1974
- Equational languagesInformation and Control, 1972
- Optimum binary search treesActa Informatica, 1971
- A Formal Basis for the Heuristic Determination of Minimum Cost PathsIEEE Transactions on Systems Science and Cybernetics, 1968