Complexity of an optimisation problem in 3D
Since TSP is NP-complete, most problems you'll encounter in practice can be.  (NP is a pretty general class.)  A classic paper of Karp gives a large number of other NP-complete problems that, by definition, can be reduced to TSP.