動態(tài)規(guī)劃及其算法應(yīng)用

打開文本圖片集

摘要：動態(tài)規(guī)劃是指一種通過若干步驟使決策不斷優(yōu)化的通用方法，在運(yùn)籌學(xué)、控制論，以及對如今熱議話題“人工智能”衍生的近似動態(tài)規(guī)劃中得到廣泛的應(yīng)用。本文將從公共子序列的最大長度問題入手，并引入0-1背包問題，對動態(tài)規(guī)劃進(jìn)行應(yīng)用。

關(guān)鍵詞：最優(yōu)化問題;最長公共子序列;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 概述

動態(tài)規(guī)劃類似于分治法。（剩余2443字）