Thinking Mathematically (6th Edition)

Published by Pearson
ISBN 10: 0321867327
ISBN 13: 978-0-32186-732-2

Chapter 14 - Graph Theory - 14.3 Hamilton Paths and Hamilton Circuits - Exercise Set 14.3: 54

Answer

The traveling salesperson problem is the problem of determining the Hamilton circuit with the smallest total weight. The optimal solution is the Hamilton circuit which has the smallest total weight.

Work Step by Step

The traveling salesperson problem is the problem of determining the Hamilton circuit with the smallest total weight. The optimal solution is the Hamilton circuit which has the smallest total weight. Note that the optimal solution, the Hamilton circuit with the smallest total weight, shows the route that a traveling salesperson could take which has the shortest possible distance.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.