动态规划及其算法应用

打开文本图片集

摘要：动态规划是指一种通过若干步骤使决策不断优化的通用方法，在运筹学、控制论，以及对如今热议话题“人工智能”衍生的近似动态规划中得到广泛的应用。本文将从公共子序列的最大长度问题入手，并引入0-1背包问题，对动态规划进行应用。

关键词：最优化问题;最长公共子序列;0-1背包

Dynamic Programming and Its Algorithm Application

Wen ChaotingShen QiumingYao RenjieLi Shuangxi

College of Computer and Information Technology Mudanjiang Normal UniversityHeilongjiangMudanjiang157011

Abstract：Dynamic Programming，a general approach to optimizing decisions through seCapacityeral steps，is widely used in operations research，cybernetics，and approximate Dynamic Programming deriCapacityed from today's hot topic "artificial intelligence".This paper Valueill start from the maximum length problem of common subsequence，and introduce 0-1 knapsacks problem，the application and optimization of dynamic programming.

Keywords：optimization problem;longest common sub-sequence;0-1 backpack

1 概述

动态规划类似于分治法。（剩余2443字）