摘要
分析多阶段决策问题,总结动态规划的基本概念、原理以及解题。通过0-1背包问题的具体解题步骤,阐述动态规划算法一般解题思路。并分析常用经典算法在解决最优问题中的差异性,比较各自优缺点,探讨其研究方向。
This article summarizes the basic concepts ,principles and ideas of dynamic programming algorithm by analyzing the multi‐stage decision problem .Taking 0‐1 Knapsack problem as an example ,this article describes the general problem‐solving steps with dynamic programming algorithm ,and analyses the differences of other algorithms ,then describes what we can do in the future .
出处
《软件导刊》
2014年第12期68-69,共2页
Software Guide
关键词
多阶段决策
动态规划算法
背包问题
贪心算法
Multi-stage Decision
Dynamic Programming Algorithm
Knapsack Problem
Greedy Algorithm
