Deterministic Dynamic Programming
Deterministic Dynamic Programming is a dynamic programming paradigm in which the system transitions and outcomes are governed entirely by deterministic rules, such that each state and action pair leads to a unique next state without probabilistic uncertainty.
77
Publications
4.3K
Citations
180
Authors
100
Institutions
Publications per year
2017–2026
10
Parents
77
A dual algorithm for the constrained shortest path problem
Gabriel Y. Handler, Israël Zang · Networks · 1980 · 454 citations
1–5 of 77
180
3
h-index
3
h-index
China Institute of Water Resources and Hydropower Research, China
2 publications · 152 citations
2
h-index
2
h-index
2
h-index
1–5 of 180
100
Clemson University
Clemson, United States
3 h-index
6 publications
326 citations
University of Michigan
Ann Arbor, United States
3 h-index
7 publications
339 citations

Tel Aviv University
Tel Aviv, Israel
3 h-index
4 publications
964 citations
Carnegie Mellon University
Pittsburgh, United States
3 h-index
3 publications
55 citations

Pennsylvania State University
State College, United States
2 h-index
2 publications
130 citations
Massachusetts Institute of Technology
Cambridge, United States
2 h-index
2 publications
172 citations
Ford Motor Company (United States)
Dearborn, United States
2 h-index
3 publications
247 citations

Cornell University
Ithaca, United States
2 h-index
2 publications
49 citations
1–8 of 100
5 publications · 443 citations
5
h-index
3 publications · 193 citations
3
h-index
3 publications · 183 citations
3
h-index
Repository · 2 publications · 32 citations
2
h-index
2 publications · 259 citations
2
h-index
1–5