Traveling Salesman Problem/Examples

From ProofWiki
Jump to navigation Jump to search

Examples of Traveling Salesman Problem

Arbitrary Example

In the following network, the closed walk with the least total weight is the path $A \to C \to B \to A$.

Traveling-salesman-problem-example-1.png