Anton V. Eremeev. On Complexity of the Optimal Recombination for the Travelling Salesman Problem. In Peter Merz, Jin-Kao Hao, editors, Evolutionary Computation in Combinatorial Optimization - 11th European Conference, EvoCOP 2011, Torino, Italy, April 27-29, 2011. Proceedings. Volume 6622 of Lecture Notes in Computer Science, pages 215-225, Springer, 2011. [doi]