文件名称:TravelingSalespersonProblem_TSP_codes
介绍说明－－下载内容来自于网络，使用问题请自行百度
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/TravelingSalespersonProblem_TSP_codes.cpp
TravelingSalespersonProblem_TSP_codes/TravelingSalespersonProblem_TSP_codes.exe
TravelingSalespersonProblem_TSP_codes/TravelingSalespersonProblem_TSP_codes.cpp
TravelingSalespersonProblem_TSP_codes/TravelingSalespersonProblem_TSP_codes.exe
1999-2046 搜珍网 All Rights Reserved.
本站作为网络服务提供者，仅为网络服务对象提供信息存储空间，仅对用户上载内容的表现方式做保护处理，对上载内容本身不做任何修改或编辑。