Search - paths problem

Search - paths problem - List

[Algorithm] tspsa DL : 0: 旅行商问题，即TSP问题（Travelling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 -Traveling Salesman Problem, or TSP problem (Travelling Salesman Problem) is a well-known field of mathematics problems. Assuming there is a travel business to visit n cities, he must choose which path to go, via the restriction is to visit each city only once and the last to go back to the original departure city. Path selection objective is to get the path distance for all paths are the minimum.
Date : 2025-12-19 Size : 1.17mb User : 吴昆
[Algorithm] sevral_methods_for_solving_traveling_salemans_prob DL : 0: 旅行商问题（TSP）是组合优化领域的一个典型的、易于描述却难以处理的NP完全难题，其可能的路径数目与城市数目是呈指数型增长的，求解非常困难。-Traveling Salesman Problem (TSP) is the field of combinatorial optimization of a typical, easy to describe but difficult to deal with NP-complete problems, the number of possible paths is an exponential number of urban growth, and to solve very difficult.
Date : 2025-12-19 Size : 254kb User : 黄艺敏
[Algorithm] SHORTPATHmatlab DL : 0: Dijkstra算法与Floyd算法的matlab实现，以求解最短路问题-Dijkstra algorithm and Floyd algorithm matlab realize in order to solve the shortest path problem
Date : 2025-12-19 Size : 2kb User : 姚益武
[Algorithm] lvxingshangwenti DL : 0: 旅行商问题，即TSP问题（Traveling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 TSP问题是一个组合优化问题。该问题可以被证明具有NPC计算复杂性。因此，任何能使该问题的求解得以简化的方法，都将受到高度的评价和关注。 -Traveling salesman problem, the TSP problem (Traveling Salesman Problem) is a well-known field of mathematics one of the problems. Suppose there is a travel merchant n cities to be visited, he must select the path to go, passing the restriction is to visit each city only once, and the last to go back to the original departure city. Path Selection The objective is to get the path distance for the minimum value among all the paths. TSP problem is a combinatorial optimization problem. This problem can be shown to have NPC computational complexity. Therefore, any solution of the problem can be simplified method will be subject to a high degree of evaluation and attention.
Date : 2025-12-19 Size : 654kb User : zhengjie
[Algorithm] zuiduanlujing DL : 0: 一款求最短路径问题的程序，适用于寻找多条路径时求其中最短路径。-A procedure for the shortest path problem, which applies to seek the shortest path finding multiple paths.
Date : 2025-12-19 Size : 1kb User : 云小木