首页> 外文OA文献 >Comparative Study of Prim and Genetic Algorithms in Minimum Spanning Tree and Travelling Salesman Problem

【2h】

Comparative Study of Prim and Genetic Algorithms in Minimum Spanning Tree and Travelling Salesman Problem

机译：最小生成树和旅游推销员问题中Prim和遗传算法的比较研究

代理获取

本网站仅为用户提供外文OA文献查询和代理获取服务，本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文，但由于OA文献来源多样且变更频繁，仍可能出现获取不到、文献不完整或与标题不符等情况，如果获取不到我们将提供退款服务。请知悉。

页面导航

著录项
引文网络
相似文献
相关主题

著录项

作者
Andysah Putera Utama Siahaan; Andre Hasudungan Lubis;
展开▼
作者单位

展开▼
年度 2018
总页数
原文格式 PDF
正文语种
中图分类

相似文献

外文文献
中文文献
专利

1. Comparative study of prim and genetic algorithms in minimum spanning tree and travelling salesman problem [J] . Andysah Putera Utam a Siahaan, Zulfi Azhar, M. D. L. Siahaan, International Journal of Engineering & Technology . 2018,第4期

机译：最小生成树和旅行商问题中素数和遗传算法的比较研究
2. Comparative Analysis of Some Modified Prim’s Algorithms to Solve the Multiperiod Degree Constrained Minimum Spanning Tree Problem [J] . Wamiliana, Asmiati, Mustofa Usman, Indian Journal of Science and Technology . 2018,第11期

机译：解决多周期约束最小生成树问题的某些改进Prim算法的比较分析
3. Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems [J] . Mathematics of operations research . 2020,第2期

机译：预算奖品收集旅行推销员和最低生成树问题
4. The Application of Broad First Minimum Spanning Tree Algorithm Based on Prim Algorithm in P2P Network [C] . Tai Xiang Computer Science and Electronics Engineering (ICCSEE), 2012 International Conference on . 2012

机译：基于原始算法的广义第一最小生成树算法在P2P网络中的应用
5. Design and implementation of parallel graph algorithms for minimum spanning tree, list ranking, and root finding on trees. [D] . Chung, Sun Bong. 1998

机译：并行图算法的设计和实现，用于最小生成树，列表排序和树的根查找。
6. Does Determination of Initial Cluster Centroids Improve the Performance of K-Means Clustering Algorithm? Comparison of Three Hybrid Methods by Genetic Algorithm Minimum Spanning Tree and Hierarchical Clustering in an Applied Study [O] . Saeedeh Pourahmad, Atefeh Basirat, Amir Rahimi, 2020

机译：初始簇质心的确定是否提高了K-Means聚类算法的性能？应用研究中遗传算法最小生成树和分层聚类的三种混合方法的比较
7. On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees [O] . Gautam Das, Sanjiv Kapoor, Michiel Smid 1996

机译：论近似欧几里德旅游推销员之旅的复杂性和最小跨越树木
8. A LIFO Implicit Enumeration Search Algorithm for the Symmetric Traveling Salesman Problem using Held and Karp's 1-Tree Relaxation. [R] . Smith, T. H. C., Thompson, G. L. 1975

机译：基于Held和Karp 1-Tree松弛的对称旅行商问题的LIFO隐式枚举搜索算法。

Comparative Study of Prim and Genetic Algorithms in Minimum Spanning Tree and Travelling Salesman Problem

著录项

引文网络

相似文献

相关主题

期刊订阅