Dynamic Programming

Dynamic Programming is a mathematical optimization and algorithm design technique that solves complex decision or optimization problems by decomposing them into overlapping subproblems, solving each subproblem once while storing its solution, and systematically combining these stored solutions in accordance with a principle of optimality to obtain an overall optimal solution.

4.2K

Publications

279.2K

Citations

7.2K

Authors

1.9K

Institutions

Publications per year

2017–2026

702

Authors

7.2K

  1. DL
    Derong Liu

    Chinese Academy of Sciences, China

    53 publications · 7.9K citations

    37

    h-index

  2. QW
    Qinglai Wei

    Chinese Academy of Sciences, China

    45 publications · 6.4K citations

    36

    h-index

  3. RB
    Richard Bellman

    RAND Corporation, United States

    62 publications · 6.9K citations

    30

    h-index

  4. WB
    Warren B. Powell

    Princeton University, United States

    38 publications · 2.9K citations

    29

    h-index

  5. DP
    Dimitri P. Bertsekas

    Massachusetts Institute of Technology, United States

    30 publications · 4.4K citations

    23

    h-index

1–5 of 7.2K

Venues

  1. Operations Research

    109 publications · 14.6K citations

    60

    h-index

  2. European Journal of Operational Research

    146 publications · 9K citations

    52

    h-index

  3. Management Science

    75 publications · 5.8K citations

    39

    h-index

  4. IEEE Transactions on Automatic Control

    73 publications · 5.1K citations

    35

    h-index

  5. SIAM Journal on Control and Optimization

    49 publications · 2.6K citations

    32

    h-index

1–5