Chase S.

asked • 05/30/16

Repetitive Nearest-Neighbor Algorithm

suppose that in solving a tsp you use the cheapest link algorithm and find a cheapest link tour with a length of 21400 miles. suppose that you later find out that the length of an optimal tour is 20100 miles. what was the relative error of your cheapest link. tour? express your answer as a percentage, rounded to the nearest tenth of a cent.

1 Expert Answer

By:

Still looking for help? Get the right answer, fast.

Ask a question for free

Get a free answer to a quick problem.
Most questions answered within 4 hours.

OR

Find an Online Tutor Now

Choose an expert and meet online. No packages or subscriptions, pay only for the time you need.