Question: 15. In branch and bound algorithm for solving a travelling salesman problem, we may initially consider a tour by considering travelling in the order 1-2-3-...
15. In branch and bound algorithm for solving a travelling salesman problem, we may initially consider a tour by considering travelling in the order 1-2-3-... -n. The distance covered in this tour would provide a lower bound on the total distance of the optimal tour. Mark the statement as T (True) or F (False).
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
