Strange Posted January 7, 2018 Share Posted January 7, 2018 12 minutes ago, studiot said: Further suppose we consider the path ABACADAEA. That breaks the rules of the TSP - each node should only be visited once. 4 hours ago, studiot said: How much area does the optimal solution enclose? And since n now = 2, your formula becomes Having two nodes is a degenerate case as there is only one route. Link to comment Share on other sites More sharing options...
Recommended Posts
Create an account or sign in to comment
You need to be a member in order to leave a comment
Create an account
Sign up for a new account in our community. It's easy!
Register a new accountSign in
Already have an account? Sign in here.
Sign In Now