Description: Branch and bound method for solving the traveling salesman problem is simple to achieve, with the C++ code, the efficiency can be optimized through the solution 1s about the size of 25 traveling salesman problem. Comes with tools for automatic generation of test files.
To Search:
File list (Check if you may need any files):
hamilton10.in
test.bat
test.cpp
test.exe
hamilton.cpp
Download