搜索资源列表
model-of-BESS
- 关于储能电站（ＢＥＳＳ）建模的文章，采用动态规划方法求解了控制策略。-On the energy storage power station (BESS) model of the article, using the dynamic programming method to solve the control strategy.
Study-Materials
- 关于程序设计的一些想法和思路，包括动态规划、回溯、分治等-Study Materials
study-material
- 关于程序设计的一些学习资料 包括递归 递推 动态规划等-study material
333
- 求凸多边形最优三角剖分。用动态规划问题有效解决该问题。多边形是平面上一条分段线形封闭曲线。-Optimal convex polygon triangulation. Dynamic programming problem with an effective solution to the problem. Sub-polygon is a plane closed curve linear.
a
- http://acm.timus.ru/problem.aspx?space=1&num=1362 一道树形动态规划的题目解答，ural1362-http://acm.timus.ru/problem.aspx?space=1&num=1362 solution to ural 1362, category: tree DP
suanfashiyan
- 十个算法小程序：二分法、循环赛日程算法、归并分类算法、贪心算法、背包问题、最优装载、动态规划（多段图、0-1背包、资源分配问题）、回溯和分支限界法（子集和数问题）-Ten algorithm applet: dichotomy, round robin scheduling algorithms, merge classification algorithm, greedy algorithm, knapsack problem, the optimal loading, dynamic pro
arithmetic
- 采用c++语言实现动态规划问题、0-1背包问题、背包问题knap1.cpp、knap.cpp、dynamic.cpp！-The c++ language realize dynamic planning 0-1 knapsack problems knapsack problem knap1. CPP knap.CPP dynamic.CPP
dynamic-program
- // VS2008 《 算法导论 》 P193页 的动态规划装配线调度问题C代码 -<Introduction to algorithm> P 193 dynamic programing
01-beibao
- 动态规划求解01背包 vc6.0-dynamic programming 0/1 knapsack
Projects
- 分支限界法贪心算法和动态规划解决装载问题 算法分析与设计-Greedy algorithm branch and bound method and dynamic programming to solve loading problems
lu-jing-guihua
- 这是对未知路径的动态规划探讨的文档，主要包括： A*算法的基本理论 A*算法的理论 A*算法的实现-This is the unknown path dynamic planning of documents, including: The basic theory of A* algorithm The A* algorithm theory The A* algorithm to achieve
Bellman
- 说明动态规划中维数灾问题,仿真结果非常完整-the dimension disaster of dynamic programming
tsp
- 某推销员要从城市v1 出发，访问其它城市v2，v3，…，v6 各一次且仅一次，最后返回v1。D 为各城市间的距离矩阵。 问：该推销员应如何选择路线，才能使总的行程最短？ 以下是用动态规划方法，Linux下g++编译通过 -tsp the minnist distance
pku.tar
- PKU(http://poj.org/)的大量题目解答，都是被Accept的源代码，包括排序、搜索(二分、宽度优先、深度优先)、动态规划、图算法等类型，详见其中的summary文件-a large number of solutions for questions from PKU (http://poj.org/), all Accepted source code, including sorting, searching, (binary-search, breadth-first, de
LCS
- VC实现输入两个字符串，利用动态规划思想求的最长公共子序列。有可视化界面。-VC the input two strings, the use of dynamic programming requirements of the longest common subsequence. A visual interface.
01bag
- 动态规划经典问题01背包的实现，用2种实现算法。一是用递归，二是用循环。还有01背包算法的叙述和图解，通俗易懂-Dynamic programming 01bag
KnapSack
- 蛮力、动态规划、回溯、分支限界四种算法求解0/1背包问题-Four algorithms（brute force, dynamic programming, backtracking, branch and bound ） to solve 0/1 knapsack problem
Codeforces-149-D-Coloring-Brackets
- Codeforces 149 D-Coloring Brackets，动态规划求解-Codeforces 149 D-Coloring Brackets，dynamic programming
Simulated-annealing-algorithm
- 自由始端和终端的动态规划，求指标函数最小值的逆序算法递归计算程序。-Simulated annealing algorithm
Dynamic
- 采用动态规划算法解决了“田忌赛马”的类似问题-The dynamic programming algorithm to solve the similar problem of "Tian Ji s horse"