Approximate Dynamic Programming
Approximate Dynamic Programming is a computational methodology within dynamic programming that replaces exact value functions with approximated ones to manage intractability in large-scale stochastic sequential decision-making problems.
691
Publications
40.1K
Citations
1.4K
Authors
543
Institutions
Publications per year
2017–2026
243
691
1–5 of 691
1.4K
25
h-index
13
h-index
Korea Advanced Institute of Science and Technology, South Korea
10 publications · 393 citations
10
h-index
9
h-index
9
h-index
1–5 of 1.4K
543
Princeton University
Princeton, United States
25 h-index
71 publications
4.6K citations
Massachusetts Institute of Technology
Cambridge, United States
21 h-index
50 publications
4.8K citations
Missouri University of Science and Technology
Rolla, United States
18 h-index
36 publications
2.1K citations
Tsinghua University
Beijing, China
17 h-index
61 publications
2.3K citations
Georgia Institute of Technology
Atlanta, United States
15 h-index
44 publications
3.2K citations

Northeastern University
Shenyang, China
14 h-index
35 publications
2.7K citations
Stanford University
Stanford, United States
13 h-index
25 publications
2.8K citations

Cornell University
Ithaca, United States
12 h-index
23 publications
1.8K citations
1–8 of 543
28 publications · 1.6K citations
21
h-index
21 publications · 1.1K citations
20
h-index
19 publications · 2K citations
17
h-index
16 publications · 1.8K citations
15
h-index
15 publications · 2K citations
15
h-index
1–5