Process / pipelineMathematical programming
动态规划
动态规划（DP）是由Richard Bellman于1957年提出的一种精确优化技术，用于解决多阶段决策问题。它将复杂问题分解为简单、重叠的子问题，每个子问题只求解一次，并存储结果以避免重复计算。DP以最优性原理为基础，在问题表现出重叠子问题和最优子结构时，保证全局最优解。
阅读完整方法
仅限会员
登录使用免费账户登录即可阅读本节。
Method map
The neighbourhood of related methods — select a node to explore.
+5 more
来源
- Bellman, R. (1957). Dynamic Programming. Princeton University Press. ISBN: 978-0-691-07951-6
如何引用本页
ScholarGate. (2026, June 2). Dynamic Programming. ScholarGate. https://scholargate.app/zh/optimization/dynamic-programming
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
Compare side by side →