English Dictionary

dynamic programming

名詞

不可算名詞

(mathematics, computer science) An optimization method by which a problem having optimal substructure is recursively broken into simpler subproblems which are solved to produce the globally optimal solution.

日本語の意味

動的計画法: 問題をより単純な部分問題に再帰的に分割し、各部分問題の解を組み合わせることで全体の最適解を導く最適化手法。

We solved the resource allocation problem using dynamic programming, ensuring a globally optimal solution by recursively breaking it into simpler overlapping subproblems.

資源配分問題は、最適部分構造を持つ問題を再帰的により単純な重複する部分問題に分割し、それらの解を組み合わせて全体の最適解を得る最適化手法である動的計画法を用いて解きました。

意味（1）

(mathematics, computer science) An optimization method by which a problem having optimal substructure is recursively broken into simpler subproblems which are solved to produce the globally optimal solution.

The advantage of dynamic programming as a procedure for solving optimization problems is the simplification obtained by decomposition.