stefaanvermassen / TSP Public

Notifications You must be signed in to change notification settings
Fork 0
Star 1

Parallel formulation for the Traveling Salesman Problem (TSP) using branch and bound.

1 star 0 forks Branches Tags Activity

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 67 Commits
TSP		TSP
Tussentijdse versie		Tussentijdse versie
Verslag		Verslag
input		input
.gitignore		.gitignore
README.md		README.md
invoer.txt		invoer.txt
invoer2.txt		invoer2.txt
invoer3.txt		invoer3.txt

Repository files navigation

TSP

Parallel formulation for the Traveling Salesman Problem (TSP) using branch and bound. Several heuristics are used for better bounding.

About

Parallel formulation for the Traveling Salesman Problem (TSP) using branch and bound.

Report repository

Releases

No releases published

Packages

No packages published

Languages