A delivery truck must deliver packages to 5 different store locations (A, B, C, D, and E). The trip must start and end at D. The graph below shows the distances (in miles) between locations. We want to minimize the total distance traveled.
The repetitive nearest-neighbor tour starting with vertex D is given by:

A. D, C, A, B, E, D.
B. D, B, E, C, A, D.
C. D, A, B, E, C, D.
D. D, E, A, B, C, D.
E. none of these

Answer: A

Mathematics

You might also like to view...

Graph the function f(x) over the given interval. Partition the interval into 4 subintervals of equal length. Then add to your sketch the rectangles associated with the Riemann sum , using the indicated point in the kth subinterval for ck.f(x) = cos x + 3, [0, 2?], right-hand endpoint