Quick updates for \(p\)-opt TSP heuristics
type: Item
instance of: scholarly article
title: Quick updates for \(p\)-opt TSP heuristics
zbMATH Open document ID: 0756.90090
DOI: 10.1016/0167-6377(92)90061-7
published in: Operations Research Letters
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90-08
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 90152
zbMATH Keywords: exchange heuristics
zbMATH Keywords: Lin-type \(p\)-opt exchanges
zbMATH Keywords: traveling salesman
author: François Margot
MaRDI profile type: Publication
full work available at URL: 0167-6377(92)90061-7
OpenAlex ID: W2039909249
cites work: Q5187226
cites work: Computer Solutions of the Traveling Salesman Problem
cites work: Probabilistic exchange algorithms and Euclidean traveling salesman problems
Recommended article: Q4335205
Recommended article: New TSP construction heuristics and their relationships to the 2-opt
Recommended article: New TSP construction heuristics and their relationships to the 2-Opt
Recommended article: On the refinement of bounds of heuristic algorithms for the traveling salesman problem
Recommended article: Q3077271
Recommended article: Truly tight bounds for TSP heuristics
Recommended article: Overview of New Approaches for Approximating TSP
Recommended article: Fast Heuristics for Large Geometric Traveling Salesman Problems
Recommended article: Q2770502
Recommended article: The parallel complexity of TSP heuristics
description: scientific article; zbMATH DE number 90152