I am trying to build a tool for solving TSP problem using a conversion to SAT.Does there exist an efficient conversion from the Travelling Salesman Problem to the Satisfiability problem? Since they both are NP-Complete it seems like the answer might be yes.   I just need a conversion that is tractable in practice.  There are very efficient tools for the satisfiability problem and I think that if I can covert TSP to SAT, I can take advantages of thoses tools. 
SAT and TSP Problems
algorithms;graph theory;satisfiability