Universal Conditions for Algebraic Traveling Salesman Problems to be Efficiently Solvable