搜索资源列表
模拟退火法计算最短路径
- 用模拟退火法高效的计算图论中哈密顿贿赂的最短路径-simulated annealing method of calculating efficient graph theory Hamiltonian bribery Shortest Path
mathmodel
- 这是一个好的建模学习资料,赶快下载吧, 数学建模十大算法 ( 包含:蒙特卡罗算法、数据拟合、参数估计、 插值等数据处理算法、线性规划、整数规划、多元规划、二次规划等规划类问题、 图论算法、动态规划、回溯搜索、分治算法、分支定界等计算机算法、 最优化理论的三大非经典算法：模拟退火法、神经网络、遗传算法、 网格算法和穷举法、一些连续离散化方法、数值分析算法、图象处理算法）-This a good model to study the information, downloa
zxjd
- 求图中的祖先节点(不含父亲节点) 内含说明，学图论或人工智能的朋友会用到的。希望有利于理解书上的论述。-plans for their ancestral nodes (excluding the father nodes) intron show that studying graph theory in artificial intelligence or a friend will use the. Hope to understand book expositions.
cheap
- 图论经典问题——哈密尔顿回路的便宜算法的实现
floyd
- 图论中求解不含负权环的多源动态规划算法floyd
2006814174759656
- 本文讨论的问题主要涉及货运的配载，而货运配载的目标是实现车与货的高效匹配, 降低空载率以减少货物运输过程中因此而造成的经济损失。货运配载问题涉及两方面的 内容:车辆利用和货物装载。本文主要从这两个角度角度来分析解决问题。 对于问题1，我们首先通过分析复杂的变量及他们之间的关系，建立规划模型。为 了求解这个模型，我们进行了一系列的简化，使得模型求解切实可行。求得较优的方案， 而且各辆车均匀负担。该方案的总费用为4877.2。 对于问题2，我们在模型1 的基础上进行了改进采用
simulated annealing
- 模拟退火算法求解经典图论中的图着色问题的源程序-simulated annealing algorithm classic graph coloring map of the source
Spanning-tree
- 利用图论中生成树的概念编写的全部生成树代码，由于缺少中间的实数编码遗传算法代码，所以还不能得出完整的结果，但整个程序框架是正确的！-Spanning tree in graph theory using the concept of writing all the spanning tree code, the lack of the middle of the real-coded genetic algorithm code, so it can not come to a complete
GAapp
- 遗传算法在图论和优化中的应用,good article-Genet1ea1gor1thms In GraPh Theory and OPtimization
description
- 关于经典图论的算法，利用VC++来开发实现，具有很强的参考价值。-On the classical graph theory algorithms, using VC++ to develop the realization of great reference value.
genetic
- 通过遗传算法把随机点提取成曲线的程序，可以用来结合图论分析-Through the genetic algorithm to extract a random point process into a curve can be used to combine graph theory analysis
109201262ruby_allocation3
- 算法图论-Algorithm for Graph Theory
matlabtulunsuanfa
- 算法图论 MATLAB-Algorithm for Graph Theory
GATSP
- 通过此程序能够利用遗传算法解决TSP问题，即图论中从某一点出发经过所有点一次的最短路径求解问题-Through this program can take advantage of genetic algorithm to solve the TSP problem, namely, graph theory starting from a point in time through all the points for solving the shortest path problem
gbvs
- 基于图论的图片显著性分析算法。详细可参见NIPS08 paper: a graph-based saliency-Based on graph theory image analysis algorithm significantly. Details can be found NIPS08 paper: a graph-based saliency
huancheng
- 用java编的，公交换乘算法，利用图论的知识，是数模常用的算法-Compiled with java, transfer algorithm to take advantage of the knowledge of graph theory, algorithm commonly used in digital-to-analog
boost_1_47_0
- boost_1_47算法包，包括各种实用的图论算法等等。more specific to its use for documenting the Boost C++ libraries-boost_1_47 algorithm package, including a variety of practical graph algorithms, and so on. more specific to its use for documenting the Boost C++ libraries
GraphBetweennessCentrality
- 为研究复杂网络提过那个计算介数的程序，同样适用于图论的研究，是复杂网络进一步研究的基础-The study mentioned that computing betweenness procedures for the study of complex networks, the same applies to the graph theory is the basis for further research of complex networks
Contents
- 关于图论的一些基本算法，简单易懂，方便使用者-On some of the basic algorithm of graph theory, simple, user-friendly
用LINGO解决的一些图论问题
- 运用LINGO解决一些经典的图论问题，附程序(Solutions to some issues related with graph theory in virtue of LINGO(program included))