Bounds for the travelling salesman problem

Bounds for the travelling salesman problem Quiz

Spec 3.3–4 · Edexcel International A Level Maths: Quiz

Studying this course? Keep your progress in one place.

Pick an answer for each. Quizzes never use energy.

5 questions, one answer each

Each answer is checked as you go, with why.

See all 5 questions
  1. 1. A tour of length 6262 is found. The lower bound is 5555. Which statement is correct?

    • A. The shortest tour is at least 6262
    • B. The shortest tour is exactly 5555
    • C. The shortest tour is at most 5555
    • D. The shortest tour is between 5555 and 6262
  2. 2. A nearest neighbour tour from AA is AA-CC-BB-DD-AA with arcs AC=3AC=3, CB=4CB=4, BD=6BD=6, DA=8DA=8. What is the upper bound?

    • A. 2121
    • B. 1313
    • C. 1717
    • D. 1515
  3. 3. An MST has weight 2525. What upper bound does walking round it give?

    • A. 2525
    • B. 7575
    • C. 12.512.5
    • D. 5050
  4. 4. To find a lower bound, which arcs at the deleted vertex are added to the MST?

    • A. All of them
    • B. The longest two
    • C. The two shortest
    • D. Only the shortest
  5. 5. A road network has ACAC missing. The routes AA-BB-CC and AA-DD-CC have lengths 99 and 1313. What length is given to ACAC in the complete network?

    • A. 1313
    • B. 99
    • C. 2222
    • D. 1111

Quiz