搜索资源列表
8-Number
- 八数码难题至今仍然是难以真正解决的NP-hard,这里仅提供了一种实现，当然里面难免存在bug.
particle_swarm_optimization-Solve-the-TSP-problem.
- 基于粒子群优化算法（PSO）的50个城市TSP问题的求解，可推广至类似NP-hard问题。-Based on Particle Swarm Optimization (PSO) of the 50 cities TSP problem solving can be extended to a similar NP-hard problem.
BinPacking
- 十一个不同的算法解决一个NP-Hard问题。 包括遗传算法GA, 爬山算法HC。 名称：K背包问题-10 Pop,Single Ally-Gene Mutation EA 10 Pop,2 Ally-Gene Mutation EA 10 Pop,10 Ally-Gene Mutation EA 10 Pop,20 Ally-Gene Mutation 10 Pop,100 Ally-Gene Mutation 100 Pop,Single Ally-Ge
tabu_search-Solve-the-TSP-problem
- 基于禁忌搜索算法的50个城市TSP问题的求解，可推广至类似NP-hard问题。-Tabu search algorithm based on the 50 cities TSP problem solving can be extended to a similar NP-hard problem.
genetic_algorithm-Solve-the-TSP-problem
- 基于遗传算法的50个城市TSP问题的求解，可推广至类似NP-hard问题。-Genetic Algorithm Based on 50 cities TSP problem solving can be extended to a similar NP-hard problem.
ant_colony_system-Solve-the-TSP-problem
- 基于蚁群算法的50个城市TSP问题的求解，可推广至类似NP-hard问题。-Ant colony algorithm based on the 50 cities TSP problem solving can be extended to a similar NP-hard problem.
zdf
- 三维装箱问题的混合模拟退火算法，解决np-hard问题的基本思路-Three-dimensional bin-packing problem of the hybrid simulated annealing algorithm, np-hard problem to solve the basic ideas
NP
- 基于模拟退火的粒子群算法，基于自然选择的粒子群算法，基于杂交的粒子群算法-Based on simulated annealing particle swarm algorithm, based on natural selection, particle swarm optimization, particle swarm optimization based on hybrid
GA_MATLAB
- 改进遗传算算发，MATLAB，收敛快，精度高，效果不错，适用于近似求解和NP难问题-Genetic calculate fat, MATLAB, convergence, high precision, good results for NP hard problem to solve and approximate
main
- 禁忌搜索算法解决0/1整数规划NP难问题-Tabu Search Algorithm for 0/1 integer programming problem NP hard
ant
- 蚁群算法(ant colony algorithm，简称ACA)是20世纪90年代由意大利学者M．Dorigo等人首先提出来的一种新型的模拟进化算法．它的出现为解决NP一难问题提供了一条新的途径．用蚁群算法求解旅行商问题(TSP)、分配问题(QAP)、调度问题(JSP)等，取得了一系列较好的实验结果．虽然对蚁群算法研究的时间不长，但是初步研究已显示出蚁群算法在求解复杂优化问题(特别是离散优化问题)方面具有一定的优势，表明它是一种很有发展前景的方法．蚁群算法的主要特点是：正反馈、分布式计算．正反馈
KMean
- KMEAN C# In data mining, k-means clustering is a method of cluster analysis which aims to partition n observations into k clusters in which each observation belongs to the cluster with the nearest mean. This results in a partitioning of the data sp
nurse_rostering
- 护士排班问题是个NP-hard问题，用LocalSover算子可以很好解决，该算子需要另外安装，以用以学习目的。-nurse rostering as a NP-hard problem using with LocalSolver.com s LocalSolver slover which can be used freely on condition for learning
graph-coloring
- 基于greedy DSATUR 的经典着色程序-Given a graph, vertex coloring is the assignment of colors to the vertices such that no two adjacents vertices share the same color. Vertex coloring problem is NP-hard for general graphs. However for some specific graph classe
WTAwentide-pso
- wta问题的一种可能解法，现在wta问题属于NP难题，不易解决。 -Solution of the problem may be a wta, wta now belongs to NP-hard problem, easy to solve.
bpp-src
- Bin packing problem belongs to the class of NP-hard problems, like the others that were discussed in previous articles. The task is to pack a set of items of different size into bins of fixed size in such way that minimal number bins is used. Dependi
K-Kmeans_plus_Plus
- k-means++ is an improved version of kmeans algorithm that proposed a new initialization technique for the k-means clustering algorithm. It was proposed in 2007 by David Arthur and Sergei Vassilvitskii, as an approximation algorithm for the NP-hard
traveller-problem
- The travelling salesman problem (TSP) asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? It is an N
traveller-problem-1-
- The travelling salesman problem (TSP) asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? It is an N
ACO
- 應用螞蟻最佳化演算法(ACO)求解作戰防禦性武器分配問題，此問題是一重要NP-hard問題-The ant-optimization algorithm (ACO) is used to solve the problem of defensive weapon allocation. It s an important NP-hard problem