搜索资源列表
xinchengxu
- 包括GRAY码，工作分配问题，会场安排，石子，行数字三角形，最长递增子序列和最小重量机器算法。利用动态规划、回溯法和贪心法-including GRAY code, work assignment, venue arrangements, gravel, and digital triangle, the longest sequences and increase the minimum weight machine algorith
salesman
- 售货员问题，用贪心法解决问题，虽然比较简单还算可以实现基本要求-salespersons questions, greedy algorithm to solve the problem, although it is relatively simple to achieve fairly basic requirements
javaTANXINFABEIBAO
- 用JAVA编写的关于算法分析与设计里的如何用JAVA实现关于贪心法的背包问题,简单明了.有很强的实例意义.-with JAVA prepared by the analysis of the algorithm and the designing of how to use JAVA of greedy law backpack , simple and clear. a strong example of significance.
duioji
- 用贪心法实现多机调度的问题。用C语言编写的-greedy method used to achieve multi-machine scheduling problems. C language prepared by the
贪心法
- 用贪心法解决TSP问题.输入数据可求得所要的最值的结果.-greedy algorithm used to solve TSP. Input data can be obtained by the most value to the results.
贪心法求任务调度问题
- 西电算法课的贪心部分上机试验题目！
会议安排
- 本代码用贪心算法实现会议安排的最佳顺序，其目标是使得能够安排的会议数量最多，是贪心算法的典型应用-code with the greedy algorithm to achieve the best arrangements for the order, its goal is to arrange the largest number of meetings, the greedy algorithm is a typical app
suanfabaogao
- 算法设计与分析试验报告，含全部实验源代码，包括贪心法、回溯法、深度优先搜索、分治法等，内容详尽。-Algorithm design and analysis of the test report, containing all the experimental source code, including the greedy method, backtracking, depth-first search, sub-rule law,
tanxin
- 贪心法的基本思路： ——从问题的某一个初始解出发逐步逼近给定的目标，以尽可能快的地求得更好的解。当达到某算法中的某一步不能再继续前进时，算法停止。-Greedy basic idea:- from the question of a gradual solution of the initial approximation to set targets to as quickly as possible to seek a bett
bowuguan
- 对大型活动的安排，贪心法，先对结束时间排序在依次取出最大子集。-Arrangements of large-scale activities, greedy method, first the end of time in order to sort out the biggest subset.
The_design_of_computer_algorithms
- 全书从算法设计和算法分析的基本概念和方法入手，系统介绍了算法设计方法与分析技巧。全书分为3个部分：第一部分介绍算法的基本概念、算法的数学基础以及算法复杂度分析；第二部分针对排序问题和图的问题，讨论各种已有的算法，并介绍常用的算法设计方法包括分治法、贪心法、动态规划法、回溯法和分支限界法，并介绍了计算的复杂性以及NP完全问题；第三部分讲述并行计算模型和并行算法设计技术。书中每章后面都附有一定数量的习题，帮助读者理解和掌握书中的内容。-Bo
beibao
- 贪心法求解背包问题，希望对大家有帮助，还 的的的 -Knapsack problem greedy method, we would like to help, but also of the
bags
- 四种算法（动态规划、回溯法、分支限界法、贪心法）实现0-1背包问题-four algorithms including dynamic planningm,tracing,branch and bound method and greedy to implement 0-1 bag problem.
suanfaqxf
- 算法实验报告+源代码 实验一 1题 归并排序.cpp 11 实验一 2题 快速排序.cpp 12 实验二1题 贪心法求背包问题.cpp 13 实验二2题 贪心法求最短路径.cpp 16 实验三 动态规划求最短路径.cpp 17 实验四 回溯法求背包.cpp 18-Algorithm+ source code for test lab reports a problem for a m
The_Greedy_Heuristic
- 表上作业法（贪心法）的MATLAB程序 解决运输问题的算法，内部有程序代码的详细介绍以及一个算例的介绍。本人为MATLAB初学者，欢迎交流，QQ420797419-This simple heuristic usually gives good, but possibly suboptimal solutions for the transportation problem.
tan-xin-fa-shan-shu
- 贪心法删数，只是一个小的计算程序，初学者可以看看。-Greedy method is only a small number of deleted computer program for beginners can look
calabash-master
- 葫芦娃问题的一种解法，利用贪心法和本地搜索，可以得到较好的局部最优解(There are N calabash brothers numbered with 1, 2, ..., N. Each of them has a skill, which they may choose to use or not. So each of them has two states: positive if he uses the skill an
贪心法求背包问题
- 贪心法求背包问题，如何选择使得背包中物品价值最大(A greedy method for the problem of knapsack)
贪心算法
- 贪心算法（又称贪婪算法）是指，在对问题求解时，总是做出在当前看来是最好的选择。也就是说，不从整体最优上加以考虑，他所做出的是在某种意义上的局部最优解。(Greedy algorithm (also called greedy algorithm) means that when solving a problem, it always makes the best choice at present. That is to say, n
2003年全国大学生数学建模竞赛题目
- 如何利用最小的资源消耗取得理想的产量要求,是本文讨论的重点问题。文章采用两种方法——贪心法和线性规划建立模型，针对两个目标进行安排。(How to make use of the minimum resource consumption to achieve the desired output requirements is the key issue discussed in this paper. In this paper, t