I&#x27;m confused by this post. I was under the impression NP-complete problems could not be solved efficiently, but the author is saying that TSP, the most well known NP-complete problem, <i>can</i> be solved practically. I read what he wrote but did not understand what he was saying. Why is TSP famously hard if it&#x27;s actually tractable in practice?