A delivery truck must deliver packages to 6 different store locations (A, B, C, D, E, and F). The trip must start and end at A. The graph below shows the distances (in miles) between locations. We want to minimize the total distance traveled.
How many different Hamilton circuits would we have to check if we use the brute-force algorithm? (Do not count the same circuit traveled backward.)
A. 6
B. 60
C. 15
D. 30
E. none of these
Answer: B
You might also like to view...
Solve the problem. Use an annual percentage rate table if necessary.Jennifer has a 60-month fixed installment loan, with a monthly payment of $182.49. The amount she borrowed was $9000. Instead of making her 30th payment, Jennifer is paying the remaining balance on the loan. What is the total amount due to pay off the balance (use the actuarial method)?
A. $5052.72 B. $5293.44 C. $5110.95 D. $4986.89
Solve by graphing. Label the axes and show where the solution is located on the graph.Suppose y = mx + b is a mathematical model for actual time as a function of estimated time, where y represents actual time and x represents estimated time and m and b are constants. If m = 1.8 and b = -0.3, find y when x is 30 min.
A. 30.54 min B. 53.7 min C. 29.46 min D. 54.3 min
Find the unknown value in the percent proportion 
Round to the nearest tenth, if necessary.part = 4, percent = 20
A. whole = 2 B. whole = 10 C. whole = 500 D. whole = 20
Determine whether or not the equation is linear.3x = 5x - 9x
A. Not linear B. Linear