Distances between traveling salesman tours
type: Item
instance of: scholarly article
title: Distances between traveling salesman tours
zbMATH Open document ID: 0835.90113
DOI: 10.1016/0166-218X(93)E0115-F
author: Yanyan Li
published in: Discrete Applied Mathematics
publication date: 1995-05-17T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 756152
zbMATH Keywords: traveling salesman
MaRDI profile type: Publication
cites work: Q4038710
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: A modified Lin--Kernighan traveling-salesman heuristic
cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
full work available at URL: 0166-218x(93)e0115-f
OpenAlex ID: W2125113804
Recommended article: The Traveling Salesman Problem with Distances One and Two
Recommended article: The Traveling Salesman Problem under squared Euclidean distances
Recommended article: Traveling salesman problem
Recommended article: Traveling Salesman Problem of Segments
Recommended article: Q4845366
Recommended article: Q3118580
Recommended article: Tours for the traveling salesman
Recommended article: Pyramidal tours for the traveling salesman
description: scientific article; zbMATH DE number 756152