See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
10 cards from this deck
The smallest possible distance for a valid TSP route
An achievable (not necessarily optimal) route length
Weight of MST + two smallest edges from starting vertex
Nearest Neighbour Algorithm
Minimum Spanning Tree (MST) method
Two smallest edge weights from the starting vertex
Use shortcuts while maintaining Hamiltonian cycle
Tree connecting all vertices with smallest total weight and no cycles
w(AoC)leqw(AoB)+w(BoC)w(A o C) leq w(A o B) + w(B o C)w(AoC)leqw(AoB)+w(BoC)
Convert to complete network using shortest paths
Select your subjects, and get access to A+ resources today.