Description: 矩阵连乘问题。C语言编写。从别人的网址传载的，请注意不要用于商业目的。-matrix continually multiply problems. C language. Others from the website- contained, please take care not to be used for commercial purposes. Platform: |
Size: 22528 |
Author:张雪庆 |
Hits:
Description: 动态规划解一系列经典问题，包含多个不同算法哦-Dynamic programming solution of a series of classical problems, including a number of different algorithms Oh Platform: |
Size: 12288 |
Author:lin yahong |
Hits:
Description: TSP问题的动态规划求解。问题描述：旅行商问题，即TSP问题（Travelling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 -TSP dynamic programming to solve the problem. Description of the problem: traveling salesman problem, namely TSP problem (Travelling Salesman Problem) is a well-known field of mathematics problems. Assuming there is a travel businessmen to visit n cities, he must choose which path to go, via the restriction is to visit each city only once and the last to go back to the original departure city. Path selection objective is to get the path distance for all paths are the minimum. Platform: |
Size: 1045504 |
Author:黄艺敏 |
Hits:
Description: Dynamic programming. Break up a problem into a series of overlapping sub-problems, and build up solutions to larger and larger sub-problems Platform: |
Size: 327680 |
Author:supercat188 |
Hits:
Description: 用动态规划法求解TSP问题的C++源码 在Linux中用g++编译通过-Using dynamic programming method for solving TSP problems C++ Source code in Linux using g++ Compiled through Platform: |
Size: 1024 |
Author:L.Zhang |
Hits:
Description: 算法实验:1 分治法在数值问题中的应用
——最近点对问题 2 减治法在组合问题中的应用——8枚硬币问题 3 变治法在排序问题中的应用——堆排序 4 动态规划法在图问题中的应用——全源最短路径问题
-Algorithm experiment: 1 divided numerical problems in the application- the nearest point to question 2 by governance problems in the application portfolio- 8 coins 3 Variable governance issues in order of application- HEAPSORT 4 dynamic programming problems in the application map- the whole question of the source of the shortest path Platform: |
Size: 287744 |
Author:邱名楷 |
Hits:
Description: 优化模型其中最基本的有线性规划模型、整数规划模型、动态规划模型以及一些几何极值问题-Optimization model in which there is the most basic linear programming model, integer programming model, dynamic programming model as well as some geometric extremal problems Platform: |
Size: 46080 |
Author:rose |
Hits:
Description: 详细讲解了动态规划的算法问题，再通过“装箱问题”等7个程序实例介绍解决动态规划问题的思路和方法。-Gave a detailed algorithm for dynamic programming problems, and through the " bin-packing problem" and other instances of seven procedures introduced to solve the problem of dynamic programming ideas and methods. Platform: |
Size: 146432 |
Author:吴贵洪 |
Hits:
Description: 动态规划入门问题：导弹防御 的解答与源程序，包含样例输入与输出-Introduction to dynamic programming problems: answers and the source of missile defense, including sample input and output Platform: |
Size: 1024 |
Author:张无忌 |
Hits:
Description: 利用动态规划来完成找零钱问题
计一个动态规划算法如何解决找零问题，对1≤j≤L，计算出所有的C( n,j )。算法中只允许实用一个长度为L的数组。找出用钱的最小个数。
（2） 0<=k<=j i>=1 i<=n,maxint c（i，k）硬币枚数
-Dynamic programming problems to complete the count to keep the change a dynamic programming algorithm to solve the problem give change for 1 ≤ j ≤ L, to calculate all the C (n, j). Algorithm is only practical with a length L of the array. Find the minimum number of money. (2) 0 < = k < = ji> = 1 i < = n, maxint c (i, k) the number of gold coins Platform: |
Size: 901120 |
Author:钱民 |
Hits:
Description: 这是算法设计与分析课程实验，动态规划的源程序。包含最长上升子序列，最长公共子序列，最大字段和问题，DP背包问题-This is a test algorithm design and analysis programs, dynamic programming source code. Rising sequence containing the longest, longest common subsequence, maximum field and problems, DP knapsack problem Platform: |
Size: 2048 |
Author:林达 |
Hits:
Description: 给定n个矩阵{A1,A2,…,An}，其中Ai与Ai+1是可乘的，i=1,2,…,n-1。要算出这n个矩阵的连乘积A1A2…An。由于矩阵乘法满足结合律，故计算矩阵的连乘积可以有许多不同的计算次序。这种计算次序可以用加括号的方式来确定。若一个矩阵连乘积的计算次序完全确定，也就是说该连乘积已完全加括号，则可以依此次序反复调用2个矩阵相乘的标准算法计算出矩阵连乘积。本文的功能是采用动态规划算法，给出矩阵的一种最优的加括号方式，是计算量最小。-Given n matrices {A1, A2, ..., An}, where Ai and Ai+1 is a mere of, i = 1,2, ..., n-1. To calculate the n matrix with the product A1A2 ... An. Since matrix multiplication to meet with law, so the calculation of the matrix with the product can have many different calculation order. This calculation can be bracketed in order to determine ways. Even if the product of a matrix calculation to determine the complete sequence, that the product is fully bracketed with, so you can call the order of 2 repeated the standard matrix multiplication algorithm to calculate the matrix with the product. This feature is the use of dynamic programming algorithm, a matrix is given in parentheses best way is to calculate the minimum amount. Platform: |
Size: 13312 |
Author:阿四 |
Hits:
Description: 动态规划的问题，有基础类的背包问题，邮局问题等，里面也有该类问题的源码-Dynamic programming problem, the knapsack problem with class-based, post offices and so on, which is also the source of such problems Platform: |
Size: 677888 |
Author:lijianglei |
Hits:
Description: 介绍动态规划法的设计思想并举例，有串匹配问题，排序问题，组合问题中的动态规划法，既有伪代码也有源程序-Design ideas of the dynamic programming method, and for example, the string matching problem, scheduling problem, dynamic programming in combinatorial problems, both pseudo-code source Platform: |
Size: 175104 |
Author:乔艳梅 |
Hits:
Description: 在我的csdn上多次下载。关于兑换零钱问题的动态规划问题求解-Many times in my csdn download. Change issues on the exchange of dynamic programming problems Platform: |
Size: 194560 |
Author:dchao |
Hits:
Description: 用动态规划解决流水线作业调度问题1）三条流水线2）装配站的数目n可定制 3）装配站的装配代价及不同流水线之间的运输代价均可定制
-Pipeline operations using dynamic programming to solve scheduling problems a) three line 2) the number n of assembly stations can be customized 3) assembly station assembly costs and transport costs between the different lines can be customized Platform: |
Size: 1024 |
Author:丁桂芝 |
Hits:
Description: 利用matlab语言，采用动态规划算法解决机器设备的调度问题，运行速度快，运行结果完美。-analyzes the allocation of resources in dynamic programming with Matlab , and conducts
procedure designs and computation with Matlab , simplifying complex issues and avoiding the cumbersome
calculations to make more convenient solutions to problems . Platform: |
Size: 143360 |
Author:王东方 |
Hits:
Search - dynamic programming problems