登录
首页 » AI-NN-PR » Lin

Lin

于 2023-08-04 发布 文件大小:17.48 kB
0 126
下载积分: 2 下载次数: 1

代码说明:

Lin-Kernighan的R-Opt算法。主要思想是CLK,小规模的TSP可以在很短的时间内都到最优解。-Lin-Kernighan algorithm for the R-Opt. The main idea is CLK, small-scale TSP can be in a very short period of time have gone to the optimal solution.

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • FCM algorithm and testing, the achievement of the source data sets commonly used...
    FCM算法的实现及测试,该源码实现常用数据集的测试。-FCM algorithm and testing, the achievement of the source data sets commonly used test.
    2022-02-28 11:42:23下载
    积分:1
  • 数据挖掘算法(Apriori)
    数据挖掘算法(Apriori)--JAVA实现-(Apriori)--JAVA
    2022-10-22 13:30:03下载
    积分:1
  • 遗传算法的源程序例子,对于初学者有很大帮助,建议多
    遗传算法的源程序例子,对于初学者有很大帮助,建议多-Genetic algorithm source code examples are very helpful for beginners, the proposed multi-
    2022-02-21 17:49:26下载
    积分:1
  • MATLAB环境下的遗传算法源程序代码压缩包
    MATLAB环境下的遗传算法源程序代码压缩包-MATLAB environment genetic algorithm source code package
    2022-08-23 23:13:42下载
    积分:1
  • 使用BP网络进行模式识别,识别0-9的数字
    使用BP网络进行模式识别,识别0-9的数字-Using the BP network pattern recognition, identifying the number of 0-9
    2023-02-02 13:40:04下载
    积分:1
  • 模式识别HK分类算法 vc下dos程序
    模式识别HK分类算法 vc下dos程序-pattern recognition algorithm vc HK classification procedures under dos
    2022-03-19 03:48:28下载
    积分:1
  • this program is the Mining Association Rules field rules algorithm.
    本程序实现的是关联规则挖掘领域中规则发现算法.-this program is the Mining Association Rules field rules algorithm.
    2022-09-04 02:30:02下载
    积分:1
  • 蚁群算法 关于城市旅行商问题 ,有兴趣的可以参考下,也课参与交流...
    蚁群算法 关于城市旅行商问题 ,有兴趣的可以参考下,也课参与交流-Ant colony algorithm on the city traveling salesman problem, interested can refer to, it is also involved in the exchange of lessons
    2022-07-10 08:41:09下载
    积分:1
  • 这是一个神经网络学习算法的模型和一个概述。
    这是对BP神经网络模型与学习算法的一个概述,也就是基础的希望对大家有用。-This is a model of BP neural network learning algorithm and an overview of the foundation is useful for all of us hope.
    2023-06-25 16:20:03下载
    积分:1
  • K-均值聚类算法的编程实现。包括逐点聚类和批处理聚类。K-均值聚类的的时间复杂度是n*k*m,其中n为样本数,k为类别数,m为样本维数。这个时间复杂度是相当客观的。因为如果用每秒10亿次的计算机对50个样本采用穷举法分两类,寻找最优,列举一遍约66.7天,分成3类,则要约3500万年。针对算法局部最优的缺点,本人正在编制模拟退火程序进行改进。希望及早奉给大家,倾听高手教诲。-K-means clustering algorithm programming. Point by point, including clustering and clustering batch. K-means clustering of the time complexity of n* k* m, n samples, several types of k, m sample dimension. The time complexity is a very objective. Because if we use one billion times per second the computer using 50 samples of two exhaustive method to find the optimal set out again about 66.7 days, divided into three categories, offering 3,500 years. Local optimal algorithm against the shortcomings, I was prepared simulated annealing process improvements. Early Feng hope for everyone, listen to the master teachings.
    2022-01-28 00:58:44下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载