LP Travelling Salesman Problem in Gurobi (with Python)

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

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

Name		Name	Last commit message	Last commit date
Latest commit History 3 Commits
__pycache__		__pycache__
data		data
.gitattributes		.gitattributes
README.md		README.md
dfj.py		dfj.py
main.py		main.py
sols.txt		sols.txt
tsputil.py		tsputil.py

Provide feedback