Jump to content

How can we check a solution to the Traveling Salesman Problem

TakenItSeriously
in Computer Science

Featured Replies

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. 

Archived

This topic is now archived and is closed to further replies.

Go to topic listing

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.

Configure browser push notifications
Chrome (Android)
  1. Tap the lock icon next to the address bar.
  2. Tap Permissions → Notifications.
  3. Adjust your preference.
Chrome (Desktop)
  1. Click the padlock icon in the address bar.
  2. Select Site settings.
  3. Find Notifications and adjust your preference.