A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
On Complexity of the Optimal Recombination for the Travelling Salesman Problem
[chapter]
2011
Lecture Notes in Computer Science
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.
doi:10.1007/978-3-642-20364-0_19
fatcat:3mvkkwlodrbzpfjpl6xivuxxwy