Computing Compatible Tours for the Symmetric Traveling Salesman Problem