Editing Dynamic programming (section)

== External links ==
{{external links|date=March 2016}}
* [http://mat.gsia.cmu.edu/classes/dynamic/dynamic.html A Tutorial on Dynamic programming]
* [https://ocw.mit.edu/courses/6-006-introduction-to-algorithms-spring-2020/resources/lecture-15-dynamic-programming-part-1-srtbot-fib-dags-bowling/ MIT course on algorithms] - Includes 4 video lectures on DP, lectures 15–18
* [http://web.mit.edu/15.053/www/AMP.htm Applied Mathematical Programming] by Bradley, Hax, and Magnanti, [http://web.mit.edu/15.053/www/AMP-Chapter-11.pdf Chapter 11]
* [http://www.csse.monash.edu.au/~lloyd/tildeAlgDS/Dynamic More DP Notes]
* King, Ian, 2002 (1987), "[http://researchspace.auckland.ac.nz/bitstream/handle/2292/190/230.pdf A Simple Introduction to Dynamic Programming in Macroeconomic Models.]" An introduction to dynamic programming as an important tool in economic theory.
* [http://www.topcoder.com/tc?module=Static&d1=tutorials&d2=dynProg Dynamic Programming: from novice to advanced] A TopCoder.com article by Dumitru on Dynamic Programming
* [https://bibiserv.cebitec.uni-bielefeld.de/adp/welcome.html Algebraic Dynamic Programming] – a formalized framework for dynamic programming, including an [https://bibiserv.cebitec.uni-bielefeld.de/cgi-bin/dpcourse entry-level course] to DP, University of Bielefeld
* Dreyfus, Stuart, "[http://www.cas.mcmaster.ca/~se3c03/journal_papers/dy_birth.pdf Richard Bellman on the birth of Dynamic Programming.] {{Webarchive|url=https://web.archive.org/web/20201013233916/http://www.cas.mcmaster.ca/~se3c03/journal_papers/dy_birth.pdf |date=2020-10-13 }}"
* [https://web.archive.org/web/20080626183359/http://www.avatar.se/lectures/molbioinfo2001/dynprog/dynamic.html Dynamic programming tutorial]
* [http://www.cambridge.org/resources/0521882672/7934_kaeslin_dynpro_new.pdf  A Gentle Introduction to Dynamic Programming and the Viterbi Algorithm]
* Tabled Prolog [http://www.probp.com BProlog], [http://xsb.sourceforge.net/ XSB], [https://www.swi-prolog.org/pldoc/man?section=tabling SWI-Prolog]
* [https://ifors.ms.unimelb.edu.au/tutorial/ IFORS online interactive dynamic programming modules] including, shortest path, traveling salesman, knapsack, false coin, egg dropping, bridge and torch, replacement, chained matrix products, and critical path problem.

{{Optimization algorithms|combinatorial|state=expanded}}
{{Parsers}}
{{Algorithmic paradigms}}
{{Authority control}}

{{DEFAULTSORT:Dynamic Programming}}
[[Category:Dynamic programming| ]]
[[Category:Optimization algorithms and methods]]
[[Category:Equations]]
[[Category:Systems engineering]]
[[Category:Optimal control]]