Jump to content

How can we check a solution to the Traveling Salesman Problem


TakenItSeriously

Recommended Posts

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

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 account

Sign in

Already have an account? Sign in here.

Sign In Now
×
×
  • Create New...

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.