We present an extension of the Lin-Kernighan local search algorithm for the solution of the asymmetric traveling salesman problem. Computational results suggest that our heuristic is feasible for fairly large instances. We also present some theoretical results which guided our design of the heuristic.
No takes yet. Share an insight, caveat, or question.
Kanellakis et al. (1980) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: