GitHub - dillstead/tsp: Solves the traveling salesman problem using 3-opt.

Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
data		data
.gitattributes		.gitattributes
.gitignore		.gitignore
README		README
greedy.py		greedy.py
opt.py		opt.py
solver.py		solver.py
submit.py		submit.py
threeopt.py		threeopt.py
twoopt.py		twoopt.py
utils.py		utils.py

Repository files navigation

Solves the traveling salesman problem using 3-opt.

Solves the traveling salesman problem using 3-opt.

No releases published