See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
10 questions from this quiz
Closed path visiting each vertex once
12(n−1)!\frac{1}{2}(n-1)!21(n−1)!
Heuristic algorithm
Minimum weight arc to unvisited vertex
Length of any known tour
MST of remaining vertices
lower bound ≤T≤\leq T \leq≤T≤ upper bound
Want largest lower & smallest upper bound
Create complete network KnK_nKn with shortest distances
When it forms a tour
Select your subjects, and get access to A+ resources today.