Polynomial-Space Exact Algorithms for the Bipartite Traveling Salesman Problem