Suppose that the vertices for an instance of the traveling-salesman problem are points in the plane and
Question:
Suppose that the vertices for an instance of the traveling-salesman problem are points in the plane and that the cost c (u, ν) is the euclidean distance between points u and ν. Show that an optimal tour never crosses itself.
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Introduction to Algorithms
ISBN: 978-0262033848
3rd edition
Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest
Question Posted: