Mw3spartan17
Mw3spartan17
19.11.2019 • 
Engineering

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

Solved
Show answers

Ask an AI advisor a question