Description: 包括最短路及最小生成树算法，对于参加建模很有用的-including the most short-circuit and the minimum spanning tree algorithm, for participating in modeling very useful Platform: |
Size: 4096 |
Author:笑我多情 |
Hits:
Description: 2005年电力部数学建模大赛题目：
共有61个比赛项目，1050人参加比赛。请给出算法及其框图，同时给出合理的比赛项目排序表，使连续参加两项比赛的运动员人次尽可能的少；表中“＃”号位置表示运动员参加此项比赛。建立此问题的数学模型，并且合理安排比赛项目顺序，使连续参加两项比赛的运动员人次尽可能的少；程序使用了最小生成树算法。-2005 Mathematical Modeling Contest subject : a total of 61 events, 1,050 people participate in the competition. Please give algorithm and its frame, the event is a reasonable ranking table to enable participation in two consecutive games of 000 athletes as less; Table "#" locations athletes this game. This established the mathematical model, and reasonable arrangements event sequence, and allows the two consecutive games of 000 athletes as less; Procedures for the use of the minimum spanning tree algorithm. Platform: |
Size: 36864 |
Author:容器 |
Hits:
Description: 物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location
Vehicle routing: VRP, VRP with time windows, traveling salesman problem (TSP)
Networks: Shortest path, min cost network flow, minimum spanning tree problems
Geocoding: U.S. city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting
Layout: Steepest descent pairwise interchange (SDPI) heuristic for QAP
Material handling: Equipment selection
General purpose: Linear programming using the revised simplex method, mixed-integer linear programming (MILP) branch and bound procedure
Data: U.S. cities with populations of at least 10,000, U.S. highway network (Oak Ridge National Highway Network), U.S. 3- and 5-digit ZIP codes -logistics analysis tool kit. Facility location : Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated Vehicle routing facility location : VRP, VRP with time windows, the traveling salesman problem (TSP) Networks : Shortest path, min cost network flow, minimum spanning tree Geocoding problems : world city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting Layout : Steepest descent Pairwise interchange (Constituencies) heuristic for QAP Material handling : Equipment selection General purpose : Linear programming using the revised simplex method, mixed-integer linear programming programming (MILP) branch and bound procedure Data : world cities with populations of at least 10,000, U. Platform: |
Size: 4853760 |
Author:陈宝文 |
Hits:
Description: 最小生成树的kruskal算法
自己写的
要是再说有重复 我可就怒了-the Kruskal minimum spanning tree algorithm wrote it myself if I say that there is no duplication of anger on Platform: |
Size: 1024 |
Author:bwj |
Hits:
Description: 图论中最小生成树Kruskal算法 及画图程序 M-函数
格式 [Wt,Pp]=mintreek(n,W)：n为图顶点数,W为图的带权邻接矩阵，不构成边的两顶点之间的权用inf表示。显示最小生成树的边及顶点, Wt为最小生成树的权,Pp(:,1:2)为最小生成树边的两顶点,Pp(:,3)为最小生成树的边权,Pp(:,4)为最小生成树边的序号 附图,红色连线为最小生成树的图
例如
n=6 w=inf*ones(6)
w(1,[2,3,4])=[6,1,5] w(2,[3,5])=[5,3]
w(3,[4,5,6])=[5,6,4] w(4,6)=2 w(5,6)=6
[a,b]=mintreek(n,w)
-Graph theory Kruskal minimum spanning tree algorithm and Paint program M-function format [Wt, Pp] = mintreek (n, W): n for the map Vertices, W for weighted graph adjacency matrix, does not constitute the edge of the two vertices of between the right to express with inf. Show the minimum spanning tree of edges and vertices, Wt right for the Minimum Spanning Tree, Pp (:, 1:2) for the minimum spanning tree edges of the two vertices, Pp (:, 3) for the minimum spanning tree of the right side, Pp ( :, 4) For the minimum spanning tree graph edge serial number, red connection for the minimum spanning tree of graph such as n = 6 w = inf* ones (6) w (1, [2,3,4]) = [ 6,1,5] w (2, [3,5]) = [5,3] w (3, [4,5,6]) = [5,6,4] w (4,6) = 2 w (5,6) = 6 [a, b] = mintreek (n, w) Platform: |
Size: 1024 |
Author:lluo |
Hits:
Description: 使用集合命令编写的图论最短路dijkstra算法的matlab程序，flord算法的matlab程序，最大匹配的匈牙利算法（hungary）matlab程序，最小生成树的两种方法编写的matlab程序，最小费用最大流matlab程序-Prepared in order to use a collection of graph theory Dijkstra shortest path algorithm matlab program, flord algorithm matlab procedures, the maximum matching algorithm Hungary (hungary) matlab procedures, minimum spanning tree, prepared by two methods matlab procedures, the minimum cost maximum flow matlab program Platform: |
Size: 5120 |
Author:任龙 |
Hits:
Description: 最小生成树Prim算法的matlab文件，无论是在数据结构还是在图论中都有广泛的应用-Prim minimum spanning tree algorithm matlab file, whether in data structures or graph theory, there are a wide range of applications Platform: |
Size: 1024 |
Author:小明 |
Hits:
Description: matlab实现的最小生成树的两种最基本的算法即Kruskal，Prim。-matlab realization of the minimum spanning tree algorithm that is, the two most basic Kruskal, Prim. Platform: |
Size: 1024 |
Author:michael wang |
Hits:
Description: 最小生成树的matlab程序，运行并检验过，运行成功，可以应用。-Minimum Spanning Tree matlab procedures, and test run, and run successfully, can be applied. Platform: |
Size: 1024 |
Author:齐齐 |
Hits:
Description: 图论模型及方法 搞计算机算法和数学建模的人都知道图论是一个很重要的内容。本资料介绍了图论中的最短路算法、匹配、邮递员和货郎问题、最小生成树、网络流等经典问题。而且有非常经典易懂的Matlab程序。-Graph theory and methodology of engaging in computer algorithms and mathematical modeling of the people know that graph theory is a very important content. The information presented in graph theory the most short-circuit algorithm, matching, and saleman & postman problem, minimum spanning tree, network flow problem, such as the classic. Has a very classic and easy-to-understand Matlab programme . Platform: |
Size: 231424 |
Author:qiu |
Hits:
Description: matlab 遗传算法GA，粒子群算法PSO,蚁群算法AS
前段时间上智能计算方法实验课上，自己做的程序。帖到这里，希望有人能改进它们，交流经验这样更有价值。
遗传算法解决最小生成树问题，PURFER编码。
粒子群算法做无约束最优化问题。
蚁群算法解决TSP问题。
如果有宝贵经验希望能交流一下，谢谢，-matlab genetic algorithm GA, particle swarm optimization PSO, ant colony algorithm for calculation of AS some time ago on the intelligent test classes, make their own procedures. Quote here, hope someone can improve them, and exchange of experience which is more valuable. Genetic algorithm to solve the minimum spanning tree problem, PURFER coding. Particle swarm optimization to do unconstrained optimization problem. Ant colony algorithm to solve the TSP problem. If there is hope to exchange our experience, thank you, He He Platform: |
Size: 5120 |
Author:stephen |
Hits:
Description: 用MATLAB实现最小生成树，可以应用在网络分簇、计算权值等多种应用场合-Using MATLAB to achieve the minimum spanning tree, can be applied to network clustering, calculation of weight and many other applications Platform: |
Size: 25600 |
Author:wq |
Hits:
Description: 图论中的最小生成树模型，基于MATLAB实现-The minimum spanning tree graph theory model, based on MATLAB implementation Platform: |
Size: 2048 |
Author:Xuyueshu |
Hits:
Description: 常用图论算法及其MATLAB程序代码：
1.最短路的Warshall-Floyd算法
2.最小生成树Kruskal避圈法
3.二部图G的最大匹配的算法(匈牙利算法)(The commonly used graph theory algorithm and its MATLAB program code:
1. shortest path Warshall-Floyd algorithm
2. minimum spanning tree Kruskal avoidance method
3. the maximum matching algorithm of the two part graph G (Hungary algorithm)) Platform: |
Size: 37888 |
Author:解码 |
Hits:
Search - minimum spanning tree matlab