mpicc -o closure .c -lm 运行：可以使用命令 mpirun –np SIZE closure来运行生成的默认文件closure，其中SIZE是所使用的处理器个数-mpicc-o closure closure.c-lm run: You can use the command mpirun-np the SIZE a closure to run the generated default file a closure, where SIZE is used by th

经典旅行商问题的并行解法。精确旅行商问题是NP问题，这里使用并行的办法获得一个精确解，大概在15个节点用8台1.7Ghz节点运行耗时30min-basic tsp algorithm code. using mpich2.

For this project I implemented a parallel formulation for the Traveling Salesman Problem (TSP). The TSP is a NP-hard problem in combinatorial optimization. Given a list of cities with their pairwise distance, the task is to find the shortest route th