On Complexity of the Optimal Recombination for the Travelling Salesman Problem

Abstract. The computational complexity of the optimal recombination for the Travelling Salesman Problem is considered both in the symmetric and in the general cases. Strong NP-hardness of these optimal recombination problems is proven and solving approaches are considered.