Skip to content

Python implementation of Travelling Salesman Problem (TSP) using branch-and-bound algorithm.

License

Notifications You must be signed in to change notification settings

mostafabahri/tsp-solver

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 
 
 

Repository files navigation

TSP Branch and Bound

Traveling Sales Person, using branch and bound.

In this python implementation, def travel(@params) finds a solution to TSP with the def bound(@params) determinging the bound of current node of space tree.

About

Python implementation of Travelling Salesman Problem (TSP) using branch-and-bound algorithm.

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages