搜索资源列表
贪心算法球园排列问题
- 贪心算法球园排列问题，算法设计与分析课程的作业。-greedy algorithm with the ball park, algorithm design and analysis programs work.
生成最短路径贪心算法
- 《计算机算法基础》（华工版）关于单源点最短路径生成最短路径贪心算法；-"computer algorithms" (laborers version) on the single-source shortest path generation Shortest Path greedy algorithm;
贪心算法实现多处理机调度
- 该程序是有关于利用贪心算法实现多处理机调度，可以在vc++上直接运行，只有源代码
单源点最短路径贪心算法
- 单源点最短路径贪心算法：用到Dijkstra算法，-single source shortest path greedy algorithm : use Dijkstra algorithm,
贪心算法
- 模式识别中的贪心算法，是根据分配篮球队员的简单条件做的-pattern recognition of greedy algorithm is based on the distribution of basketball players do the simple conditions
贪心算法背包问题
- 这个小程序，是我作为C#初学者的省份写出来，主要是练手的。主要是在算中的一种思想。环境VS2010，传于2010-10-31，地点安徽马鞍山某高校
背包问题的贪心算法
- 背包问题的贪心算法
哈夫曼编码,最优前缀码的贪心算法
- 哈夫曼编码,最优前缀码的贪心算法,平均码长最短,Huffman codes, optimal prefix code of the greedy algorithm, the shortest average code length
用贪心算法解决旅行商问题
- 用贪心算法解决旅行商问题，能运行的，是本科四年级的软件课程设计源码！,Use greedy algorithm to solve traveling salesman problem, will be able to run is the fourth year undergraduate curriculum design of the software source code!
Greedy_Implicit-贪心算法_隐枚举法
- 贪心算法_隐枚举法（0 - 1 整数规划求解）,matlab代码-Greedy algorithm _ implicit enumeration method ( 0- 1 integer programming solver ) ,matlab code
tanxinfa.rar
- 北京大学研究生课程“算法分析与计算复杂性理论”的课件，讲的是贪心算法。,University post-graduate courses
1
- 活动安排问题 贪心算法 活动安排问题 贪心算法-The activities of the organization of the activities of the organization of greedy algorithm greedy algorithm
贪心算法
- 文件输入的01背包贪心算法，下载后手动添加一个文件即可运行
greed
- 带有期限和效益的单位时间的作业排序贪心算法。作业已按效益值递减的顺序排好，依次输入各作业的期限值，要求按顺序输出最优解。-With the duration and effectiveness of the unit time Scheduling greedy algorithm. Operating efficiency values have been decreasing order, the order input period value of the o
贪心算法
- 贪心算法（又称贪婪算法）是指，在对问题求解时，总是做出在当前看来是最好的选择。也就是说，不从整体最优上加以考虑，他所做出的是在某种意义上的局部最优解。(The greedy algorithm (called greedy algorithm) refers to, in problem solving, always seems to be made in the best choice. That is to say, do not be optimal from an overall co
贪心算法背包问题
- 一个简单贪心算法的研究，背包问题，供大家浏览参考。(A simple greedy algorithm research, knapsack problem, reference for browsing.)
贪心算法 简单问题研究
- 关于贪心算法的最优安排和稍微复杂的研究，文中给出两个小例子。(About the greedy algorithm is the optimal arrangement and study a little more complicated, two small example is given in the paper.)
部分背包的贪心算法实现
- 通过贪心算法实现装进背包物品价值最大化，具体步骤是依次选择价值密度最大的物品放入背包(Through greedy algorithm to maximize the value of goods loaded into backpacks.)
贪心算法
- 贪心算法（又称贪婪算法）是指，在对问题求解时，总是做出在当前看来是最好的选择。也就是说，不从整体最优上加以考虑，他所做出的是在某种意义上的局部最优解。(Greedy algorithm (also called greedy algorithm) means that when solving a problem, it always makes the best choice at present. That is to say, not considering the overall opt
贪心算法4.8宿营地
- 贪心算法宿营地问题 /*考察路线有n个地点作为宿营地，宿营地到出发点的距离依次为x1,x2,...xn,且满足 x1<x2<x3<x4，每天只能前进30千米，任意两个宿营地相距不超过30，每个宿营地只住 一天，求宿营天数最少*/(Greedy The expedition route has N locations as camps, and the distance from the campsite to the starting point is X1, X2, in t