Engineering
Engineering, 19.11.2019 07:31, jerrysandoval22

Optimization versus search. recall the traveling salesman problem: tsp input: a matrix of distances; a budget b output: a tour which passes through all the cities and has length ≤ b, if such a tour exists. the optimization version of this problem asks directly for the shortest tour. tsp-opt input: a matrix of distances output: the shortest tour which passes through all the cities. show that if tsp can be solved in polynomial time, then so can tsp-opt

answer
Answers: 2

Similar questions

Do you know the correct answer?
Optimization versus search. recall the traveling salesman problem: tsp input: a matrix of distance...

Questions in other subjects:

Konu
Mathematics, 11.06.2021 21:10
Konu
Mathematics, 11.06.2021 21:10