Local Search for the Asymmetric Traveling Salesman Problem

Paris-C. Kanellakis and Christos H. Papadimitriou
Additional contact information
Paris-C. Kanellakis: Massachusetts Institute of Technology, Cambridge, Massachusetts
Christos H. Papadimitriou: Massachusetts Institute of Technology, Cambridge, Massachusetts

Operations Research, 1980, vol. 28, issue 5, 1086-1099

Abstract: 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.

Date: 1980
References: Add references at CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.28.5.1086 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:28:y:1980:i:5:p:1086-1099

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().