Skip to main content
Oct 25, 2010 3:12 PM UTC
Question

Reverse Travelling salesman problem

This salesman in Luxemburg uses not the nearest neighbour algorithm but the remote (reverse) neighbo(u)r algorithm and travels not from the first to the last city but from the last to the first city (reverse)!

The direct Travelling salesman problem

 

Can you say me what is not short path but longest path of the salesman in Luxemburg?

It is a math(cad) problem too!

 

 

Unable to play video. Please try again later.
(view in My Videos)