Skip to content

Solve traveling salesman problem (TSP) using branch and bound or brute force.

License

Notifications You must be signed in to change notification settings

tony2guo/traveling-salesman-problem

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

traveling-salesman-problem

Solve traveling salesman problem (TSP) using branch and bound or brute force.

Homework of National Tsing Hua University (NTHU) 109 20 CS 431100 Design and Analysis of Algorithms

  • Open In Colab

  • Set use_input_txt = 1 if you want to use input from file, or set use_input_txt = 0 to auto generate input data.

  • Upload input.txt to current directory at the "Files" bar on the left

  • Click "Runtime" and "Run all" and see the output file BF.txt and BB.txt in current directory

runtime

About

Solve traveling salesman problem (TSP) using branch and bound or brute force.

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published