搜索资源列表
tsp
- 用分支定界法求解旅行商问题旅行商问题是一个经典NP问题：有n个城市，一个推销员要从其中的某一个城市出发，每个城市只能遍历一次，要求走遍所有的城市，再回到他出发的城市，求所有可能路径中路径最短的一条路径来。
tsp
- 结合旅行商问题，学习并掌握遗传算法。并从实例中体会遗传算法对解决NP问题的重要性。遗传算法解决旅行商问题-Combination of traveling salesman problem, to learn and master the genetic algorithm. Experience from the examples of genetic algorithm to solve the NP problem. Genetic Algorithm to Solve Traveling
Theory-of-NP-approximation-algorithm
- NP完全性理论与近似算法课件，有详细讲解-Theory of NP-approximation algorithm with the courseware, a detailed explanation
Class-scheduling-genetic-algorithm
- The Class Scheduling Problem (CSP) is concerned with assigning a number of courses corresponding to various students and instructors to classrooms taking into consideration constraints like classroom capacities and university regulations. Th
juzhen
- 矩阵的乘法.只有当矩阵A的列数与矩阵B的行数相等时A×B才有意义。一个m×n的矩阵a（m,n)左乘一个n×p的矩阵b（n,p)，会得到一个m×p的矩阵c（m,p)-Matrix multiplication
Man-slash-NP-Collection-130
- C#学习其实还是蛮实用的，供大家学习参考 希望最大家有用-C# learning but it is still quite useful for everyone to learn reference I hope most useful to everyone