文件名称:TravelingSalespersonProblem_TSP_codes
- 所属分类：
- 人工智能/神经网络/遗传算法
- 资源属性：
- [C/C++] [源码]
- 上传时间：
- 2012-11-26
- 文件大小：
- 132kb
- 下载次数：
- 0次
- 提 供 者：
- 黃**
- 相关连接：
- 无
- 下载说明：
- 别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容均来自于网络，请自行研究使用
Traveling Salesperson Problem
Our branch-and-strategy splits a branch and bound solution into two groups:
one group including a particular arc and the other excluding this arc.
1.Each splitting incurs a lower bound and we shall traverse the searching tree with the "lower" lower bound.
2.If a constant subtracted from any row
or any column of the cost matrix, an
optimal solution does not change.
Our branch-and-strategy splits a branch and bound solution into two groups:
one group including a particular arc and the other excluding this arc.
1.Each splitting incurs a lower bound and we shall traverse the searching tree with the "lower" lower bound.
2.If a constant subtracted from any row
or any column of the cost matrix, an
optimal solution does not change.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
TravelingSalespersonProblem_TSP_codes
.....................................\TravelingSalespersonProblem_TSP_codes.cpp
.....................................\TravelingSalespersonProblem_TSP_codes.exe
.....................................\TravelingSalespersonProblem_TSP_codes.cpp
.....................................\TravelingSalespersonProblem_TSP_codes.exe