Dynamic programming: Difference between revisions

Content deleted Content added
m Reverted edits by 122.168.199.202 (talk): using improper humor in articles (WP:NPOV, WP:V) (HG) (3.4.10)
Repair dead link to ifors dynamic programming modules, with explicit mention of IFORS as per their copyright policy: https://ifors.ms.unimelb.edu.au/tutorial/copyright.html
Line 615:
* [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] and [http://xsb.sourceforge.net/ XSB]
* [httphttps://ifors.orgms.unimelb.edu.au/tutorial/category/dynamic-programming/ OnlineIFORS online interactive dynamic programming modules]{{Dead link|date=April 2020}} 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}}