文件名称:TSP
介绍说明－－下载内容均来自于网络，请自行研究使用
The basic principle using the branchand-
bound strategy to solve the traveling
salesperson optimization problem (TSP)
consists of two parts.
There is a way to split the solution space.
There is a way to predict a lower bound for a
class of solutions.
There is also a way to find an upper bound of
an optimal solution.
If the lower bound of a solution exceeds this
upper bound, this solution cannot be optimal.
Thus, we should terminate the branching
associated with this solution.-The basic principle using the branchand-bound strategy to solve the travelingsalesperson optimization problem (TSP) consists of two parts .
bound strategy to solve the traveling
salesperson optimization problem (TSP)
consists of two parts.
There is a way to split the solution space.
There is a way to predict a lower bound for a
class of solutions.
There is also a way to find an upper bound of
an optimal solution.
If the lower bound of a solution exceeds this
upper bound, this solution cannot be optimal.
Thus, we should terminate the branching
associated with this solution.-The basic principle using the branchand-bound strategy to solve the travelingsalesperson optimization problem (TSP) consists of two parts .
(系统自动生成,下载前可以参看下载内容)
下载文件列表
TSP
...\TSP.cpp
...\TSP.cpp