搜索资源列表
suanfafenxiyusheji
- 算法分析与设计课程设计基于贪心法的装箱问题设计报告
tanxinxiang
- 算法分析与设计课程设计基于贪心法的装箱问题设计报告
suanfashiyanbaogao
- 算法设计实验报告 递归与分治 和贪心算法-Recursive algorithm design lab report and the greedy algorithm with sub-rule
TSPproblems
- 解决TSP问题的几种算法 模拟退火法 遗传算法 贪心算法等-To solve the problem of several TSP algorithm simulated annealing greedy algorithm such as genetic algorithms
Prim
- 用贪心算法，求解最短路径问题； 通过根据当前的最优情况，选择最好的节点；-greedy alogith ,in order to get the best result for the station of the matter
11
- 算法设计报告，有5种算法，动态规划，贪心法，回溯法，递归，分支界限法
SUANFAPPT
- 常用的算法设计策略(包括分治策略、动态规划、贪心策略、回溯法、随机算法等) 算法复杂度分析方法(计算迭代次数、使用递归方程、频度分析等) -Commonly used algorithm design strategies (including the strategy of divide and conquer, dynamic programming, greedy strategy, backtracking method, random algorithm) algorithm
algorithm1
- 动态规划可以找到最优子结构特征，贪心算法用于求解最优化问题-Dynamic programming can be found in sub-optimal structural characteristics greedy algorithm for solving optimization problems
algorithms
- 算法导论英文版第二版；从简单的基本算法到难的贪心算法或NP难题；-Introduction to Algorithms, Second Edition English basic algorithms from simple to difficult greedy algorithms or NP-hard
package
- 改代码实现的是用贪心算法解决0—1背包问题，用c++实现。-Change the code is to solve 0-1 knapsack problem with the greedy algorithm, using c++ implementation.
algorithm
- 以设计策略为主线，循序渐进地介绍了经典算法设计（包括分治、动态规划、贪心、回溯、迭代改进等算法）、NF完全理论、非精确型算法设计〔包括近似算法、参数化算法，随机算法），以及现代智能优化方法．强调算法思维与编程实践并重，注重运用算法技术解决实际工程问题。-In order to design strategy as the main line, gradual introduction of the classic algorithm design (including the partition
Greedy-algorithm
- 贪心算法解决木棒覆盖最多点的问题，食用一定量定长的木棒，使其覆盖尽可能多的点。-Solve the problem of sticks to cover some greedy algorithm
lvxing
- 旅行商问题是NP完全的组合优化问题。分析了邻域启发式算法的基本操作,提出 一种简单的启发式贪心法,仅利用城市间的距离信息求解旅行商问题-Traveling salesman problem is np-complete combinatorial optimization problem.The basic operation of neighborhood heuristic algorithm is analyzed and presented A simple heuristic
first
- 贪心算法，哈夫曼编码 ，最优编码二叉树。(Greedy algorithm, Huffman coding, optimal coding two trees.)
graph_coloring
- 基于matlab的图着色程序，算法为贪心算法，将节点按照度从大到小排序，排序后先给度大的着色。(The graph coloring program based on MATLAB algorithm, greedy algorithm, the node according to the degree from large to small order, ranking after the first to a large degree of coloring.)