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

Authors

1.4K

  1. WB
    Warren B. Powell

    Princeton University, United States

    37 publications · 2.1K citations

    25

    h-index

  2. FL
    Frank L. Lewis

    The University of Texas at Arlington, United States

    14 publications · 2.6K citations

    13

    h-index

  3. JH
    Jay H. Lee

    Korea Advanced Institute of Science and Technology, South Korea

    10 publications · 393 citations

    10

    h-index

  4. PJ
    Paul J. Werbos

    U.S. National Science Foundation, United States

    9 publications · 1.4K citations

    9

    h-index

  5. HT
    Hüseyin Topaloğlu

    Cornell University, United States

    9 publications · 548 citations

    9

    h-index

1–5 of 1.4K

Venues

  1. European Journal of Operational Research

    28 publications · 1.6K citations

    21

    h-index

  2. 20

    h-index

  3. IEEE Transactions on Smart Grid

    19 publications · 2K citations

    17

    h-index

  4. Transportation Science

    16 publications · 1.8K citations

    15

    h-index

  5. Operations Research

    15 publications · 2K citations

    15

    h-index

1–5