A modified Lin--Kernighan traveling-salesman heuristic
type: Item
instance of: scholarly article
title: A modified Lin--Kernighan traveling-salesman heuristic
zbMATH Open document ID: 0779.90076
DOI: 10.1016/0167-6377(93)90001-W
author: M. C. Fu
published in: Operations Research Letters
publication date: 1993-11-01T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 438796
zbMATH Keywords: depth search
zbMATH Keywords: 2-OPT
zbMATH Keywords: Lin-Kernighan traveling-salesman heuristic
describes a project that uses: TSPLIB
MaRDI profile type: Publication
cites work: The traveling-salesman problem and minimum spanning trees: Part II
cites work: Q4038710
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
full work available at URL: 0167-6377(93)90001-w
OpenAlex ID: W2090390706
description: scientific article; zbMATH DE number 438796