Homework Clinic
Mathematics Clinic => Pre-calculus => Topic started by: Bob-Dole on Feb 2, 2020
-
Question 1
Use the complete weighted graph shown to answer the question.
Jon is a traveling salesman for a pharmaceutical company. His territory includes 5 cities and he needs to find the least expensive route to the cities and home. Starting at city A, which of the following is the optimal route using the Brute Force Method?
I. A, D, B, E, C, A
II. A, E, B, C, D,A
III. A, D, B, C, E, A
IV. A, B, C, E, D, A
◦ I
◦ II
◦ III
◦ IV
Question 2
Use the complete weighted graph shown to answer the question.
Using the Nearest Neighbor Method starting with vertex A, which of the following is an approximate optimal solution?
I. A, B, C, D, A
II. A, C, B, D, A
III. A, D, B, C, A
IV. A, D, C, B, A
◦ II
◦ III
◦ IV
◦ I
-
Answer 1
III
Answer 2
IV