文件名称:tsp
介绍说明－－下载内容均来自于网络，请自行研究使用
用分支定界法求解旅行商问题旅行商问题是一个经典NP问题：有n个城市，一个推销员要从其中的某一个城市出发，每个城市只能遍历一次，要求走遍所有的城市，再回到他出发的城市，求所有可能路径中路径最短的一条路径来。-Using branch and bound method for solving traveling salesman problem traveling salesman problem is a classic NP problem: have n cities, a salesman from one of a city of departure, each city can only traverse once traveled all the requirements of the City , and then returned to his starting city, and all the possible path of the shortest path to a path.
相关搜索： TSP
branch
and
bound
TSP
分支定界
c
旅行商问题
branch
and
bound
TSP
c++
branch
and
bou
tsp
branch
and
bound
branch
and
bound
for
tsp
TSP
solver
branch
bou
旅行商问题
branch
and
bound
TSP
分支定界
c
旅行商问题
branch
and
bound
TSP
c++
branch
and
bou
tsp
branch
and
bound
branch
and
bound
for
tsp
TSP
solver
branch
bou
旅行商问题
(系统自动生成,下载前可以参看下载内容)
下载文件列表
用分支界定法求旅行商问题
........................\tsp.C
........................\tsp.C