搜索资源列表
the_arithmetic_of_traveling_saleman_problem_resear
- 旅行商问题是一个经典的NP完全难题,由于其在许多领域具有研究应用价值,一直有许多学者对其进行研究。
single
- 1. compile: mpicc cjacobi.c -o cjacobi -lm 2. run: mpirun -np 4 cjacobi 3. result: Input of file \"dataIn.txt\"
Mu0.97bPatch
- 奇迹 mu 客户端 main 97 b补丁,未跳np
PSO-TSP.rar
- 本程序是一个用POS来求解NP难问题,比图TSP问题,实际仿真效果证明改算法合理,This procedure is a POS to use NP hard problem to solve than the TSP problem graph, the actual simulation results prove that a reasonable change algorithm
POS_c
- 本程序是用PSO用于求解NP难问题,如0-1背包问题,效果很好-This procedure is used PSO for solving the NP hard problems, such as 0-1 knapsack problem, well