First off, your original complaint was on the inclusion of the word "algorithm", and not the fact that they referenced supercomputers solving the problem. As such, I didn't address it since you didn't address it.

>Formally, TSP is a decision problem: whether there exists a path shorter than a given length L. That's not "easy/trivial".

Also, it is easy/trivial to solve the traveling salesman problem (Try all permutations using brute force search). It's just not easy/trivial to solve it quickly/efficiently.