A modified Lin-Kernighan traveling-salesman heuristic

Authors:
King-Tim Mak;Andrew J. Morton
Affiliations:
Information and Decision Sciences, College of Business Administration, University of Illinois at Chicago, IL, USA;Information and Decision Sciences, College of Business Administration, University of Illinois at Chicago, IL, USA
Venue:
Operations Research Letters
Year:
1993

Citing 2
Cited 0

A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems

SIAM Review
Local Optimization and the Traveling Salesman Problem

ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

The classic Lin-Kernighan traveling-salesman heuristic is modified so that the scope of its depth search is widened. The modification yields a simple yet effective heuristic that can be easily coded and adapted for general OR applications.