動態規劃(dynamic planning)
WIKI
Dynamic programming is both a mathematical optimization method and a computer programming method.In both contexts it refers to simplifying a complicated problem by breaking it down into simpler sub-problems in a recursive manner.
特點
-
動態規劃可以在給定約束條件下找到最優解
-
在問題可分解爲彼此獨立且離散的子問題時，就可以使用動態規劃來解決
-
每種動態規劃解決方案都涉及網格
-
單元格中的值通常就是要優化的值
-
每個單元格都是一個子問題