Skip to content

AnasNeumann/pyTSP

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

16 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

TSP

A simple Travelling Salesman Problem to solve (optimize) with Python and IBM Cplex for learning purposes

"Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?"

(Wikipedia.org, 2023) - https://en.wikipedia.org/wiki/Travelling_salesman_problem

problem-studied

About

A simple Travelling Salesman Problem to solve (optimize) with Python and IBM Cplex - For Learning Purposes

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors