Skip to content

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

LP Travelling Salesman Problem in Gurobi (with Python)

Implementation of several LP formulations to solve TSP in LP, the following formulations are implemented

  • Dantzig, Fulkerson and Johnson (DFJ)
  • Miller-Tucker-Zemlin (MTZ)
  • Flow
  • Dantzig Step

*DFJ is implemented to only include subtour constraints if they are not redundant.

About

Solving travelling salesman problem to optimality using Linear Programming using four different formulations in Gurobi

Topics

Resources

Stars

4 stars

Watchers

1 watching

Forks

Releases

Packages

Contributors

Languages