File:Shortest_path_optimal_substructure.svg · Wikimedia Commons · See Wikimedia Commons
dynamic programming
Sign in to saveAlso known as dynamic optimization, DP
problem optimization method that simplifies a complicated problem by decomposing it into simpler subproblems recursively
Research
5,223 papers- Quantum Dynamic Programming.Physical review letters · 2025
- Dynamic programming.Methods in molecular biology (Clifton, N.J.) · 2014
- Dynamic Programming Based Segmentation in Biomedical Imaging.Computational and structural biotechnology journal · 2017
- Adaptive dynamic programming-based hierarchical decision-making of non-affine systems.Neural networks : the official journal of the International Neural Network Society · 2023
- A systematic approach to dynamic programming in bioinformatics.Bioinformatics (Oxford, England) · 2000
via PubMed
Wikidata facts
Show 1 more fact
- Stack Exchange tag
- or.stackexchange.com/tags/dynamic-programming
via Wikidata · CC0
~40 min read
Article
Figure 1. Finding the shortest path in a graph using optimal substructure; a straight line indicates a single edge; a wavy line indicates a shortest path between the two vertices it connects (among other paths, not shown, sharing the same two vertices); the bold line is the overall shortest path from start to goal.
Dynamic programming (DP) is both a mathematical optimization method and an algorithmic paradigm. The method was developed by Richard Bellman in the 1950s and has found applications in numerous fields, such as aerospace engineering and economics.